Base | Representation |
---|---|
bin | 1000101101101111010100111… |
… | …0000111010011001100010010 |
3 | 2222102022021022012012112100201 |
4 | 2023123311032013103030102 |
5 | 1120334320120210323032 |
6 | 10012131013123405414 |
7 | 243112126356406312 |
oct | 21333651607231422 |
9 | 2872267265175321 |
10 | 613241036026642 |
11 | 168441076749041 |
12 | 5894227a22386a |
13 | 204244c63a8a7a |
14 | ab6104b38b442 |
15 | 4ad6c1770b8e7 |
hex | 22dbd4e1d3312 |
613241036026642 has 8 divisors (see below), whose sum is σ = 919936884643632. Its totient is φ = 306595407812100.
The previous prime is 613241036026639. The next prime is 613241036026691. The reversal of 613241036026642 is 246620630142316.
It is a happy number.
613241036026642 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 613241036026592 and 613241036026601.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12555070084 + ... + 12555118927.
It is an arithmetic number, because the mean of its divisors is an integer number (114992110580454).
Almost surely, 2613241036026642 is an apocalyptic number.
613241036026642 is a deficient number, since it is larger than the sum of its proper divisors (306695848616990).
613241036026642 is a wasteful number, since it uses less digits than its factorization.
613241036026642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25110201224.
The product of its (nonzero) digits is 1492992, while the sum is 46.
Adding to 613241036026642 its reverse (246620630142316), we get a palindrome (859861666168958).
The spelling of 613241036026642 in words is "six hundred thirteen trillion, two hundred forty-one billion, thirty-six million, twenty-six thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •