Base | Representation |
---|---|
bin | 100001101001110001110… |
… | …101011101110001100010 |
3 | 22012002020020010022121000 |
4 | 201221301311131301202 |
5 | 300342202133334432 |
6 | 4530221140012430 |
7 | 326036303520201 |
oct | 41516165356142 |
9 | 8162206108530 |
10 | 2312602246242 |
11 | 811850751222 |
12 | 314245991116 |
13 | 13a10122b902 |
14 | 7dd055bd238 |
15 | 40251c2057c |
hex | 21a71d5dc62 |
2312602246242 has 32 divisors (see below), whose sum is σ = 5139170784000. Its totient is φ = 770859213264.
The previous prime is 2312602246237. The next prime is 2312602246249. The reversal of 2312602246242 is 2426422062132.
2312602246242 is a `hidden beast` number, since 2 + 3 + 1 + 2 + 6 + 0 + 2 + 24 + 624 + 2 = 666.
2312602246242 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 2312602246197 and 2312602246206.
It is not an unprimeable number, because it can be changed into a prime (2312602246249) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6994884 + ... + 7318032.
It is an arithmetic number, because the mean of its divisors is an integer number (160599087000).
Almost surely, 22312602246242 is an apocalyptic number.
2312602246242 is an abundant number, since it is smaller than the sum of its proper divisors (2826568537758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2312602246242 is a wasteful number, since it uses less digits than its factorization.
2312602246242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 455687 (or 455681 counting only the distinct ones).
The product of its (nonzero) digits is 110592, while the sum is 36.
The spelling of 2312602246242 in words is "two trillion, three hundred twelve billion, six hundred two million, two hundred forty-six thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •