Base | Representation |
---|---|
bin | 1001010001110010011110… |
… | …0111100001011100010100 |
3 | 1100010020010000002220210102 |
4 | 2110130213213201130110 |
5 | 2314114040233000040 |
6 | 33410212212313232 |
7 | 2102004354206126 |
oct | 224344747413424 |
9 | 40106100086712 |
10 | 10201212000020 |
11 | 3283345257828 |
12 | 1189091312818 |
13 | 58cc7c5b0b72 |
14 | 273a54185216 |
15 | 12a5549c3515 |
hex | 947279e1714 |
10201212000020 has 48 divisors (see below), whose sum is σ = 21580554498048. Its totient is φ = 4050392321280.
The previous prime is 10201211999987. The next prime is 10201212000043. The reversal of 10201212000020 is 2000021210201.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10201211999965 and 10201212000010.
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, 37762349 + ... + 38031531.
It is an arithmetic number, because the mean of its divisors is an integer number (449594885376).
Almost surely, 210201212000020 is an apocalyptic number.
10201212000020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10201212000020 is an abundant number, since it is smaller than the sum of its proper divisors (11379342498028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201212000020 is a wasteful number, since it uses less digits than its factorization.
10201212000020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283160 (or 283158 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 10201212000020 its reverse (2000021210201), we get a palindrome (12201233210221).
The spelling of 10201212000020 in words is "ten trillion, two hundred one billion, two hundred twelve million, twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •