Base | Representation |
---|---|
bin | 101111110010110100000111… |
… | …100011001100111010111100 |
3 | 1000120020221020212000121121220 |
4 | 233302310013203030322330 |
5 | 210022404322000231022 |
6 | 2023020334052153340 |
7 | 62163312645200166 |
oct | 5762640743147274 |
9 | 1016227225017556 |
10 | 210200121102012 |
11 | 60a81409502278 |
12 | 1b6aa237308850 |
13 | 9039a2b857c62 |
14 | 39c9a50d59936 |
15 | 1947bc2dc885c |
hex | bf2d078ccebc |
210200121102012 has 48 divisors (see below), whose sum is σ = 492936136358400. Its totient is φ = 69713972488512.
The previous prime is 210200121101987. The next prime is 210200121102061. The reversal of 210200121102012 is 210201121002012.
It is a super-2 number, since 2×2102001211020122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210200121101982 and 210200121102000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 309161938 + ... + 309841094.
It is an arithmetic number, because the mean of its divisors is an integer number (10269502840800).
Almost surely, 2210200121102012 is an apocalyptic number.
It is an amenable number.
210200121102012 is an abundant number, since it is smaller than the sum of its proper divisors (282736015256388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210200121102012 is a wasteful number, since it uses less digits than its factorization.
210200121102012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 808970 (or 808968 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210200121102012 its reverse (210201121002012), we get a palindrome (420401242104024).
The spelling of 210200121102012 in words is "two hundred ten trillion, two hundred billion, one hundred twenty-one million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •