Base | Representation |
---|---|
bin | 101111110000010110101000… |
… | …100001111001011100001010 |
3 | 1000112122202210010111011022120 |
4 | 233300112220201321130022 |
5 | 210012122013414400020 |
6 | 2022410530421232110 |
7 | 62145145356556305 |
oct | 5760265041713412 |
9 | 1015582703434276 |
10 | 210031023200010 |
11 | 60a1672510a741 |
12 | 1b681504862636 |
13 | 9026ac078048c |
14 | 39c17ad027b3c |
15 | 19435c7871740 |
hex | bf05a887970a |
210031023200010 has 32 divisors (see below), whose sum is σ = 504120927785472. Its totient is φ = 56003109286080.
The previous prime is 210031023199999. The next prime is 210031023200093. The reversal of 210031023200010 is 10002320130012.
It is a super-2 number, since 2×2100310232000102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 322392121 + ... + 323042940.
It is an arithmetic number, because the mean of its divisors is an integer number (15753778993296).
Almost surely, 2210031023200010 is an apocalyptic number.
210031023200010 is an abundant number, since it is smaller than the sum of its proper divisors (294089904585462).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210031023200010 is a wasteful number, since it uses less digits than its factorization.
210031023200010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645445918.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 210031023200010 its reverse (10002320130012), we get a palindrome (220033343330022).
The spelling of 210031023200010 in words is "two hundred ten trillion, thirty-one billion, twenty-three million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •