Base | Representation |
---|---|
bin | 1001000110000101000101… |
… | …11110011111101101111100 |
3 | 2121210222202111102202112210 |
4 | 10203002202332133231330 |
5 | 10110140202104201022 |
6 | 110311530420500420 |
7 | 4132650113135100 |
oct | 443024276375574 |
9 | 77728674382483 |
10 | 20000102022012 |
11 | 6410aa520a752 |
12 | 22b01a184a710 |
13 | b210034849a8 |
14 | 4d201da17900 |
15 | 24a3adcd9a0c |
hex | 1230a2f9fb7c |
20000102022012 has 144 divisors (see below), whose sum is σ = 54367059146400. Its totient is φ = 5705786032128.
The previous prime is 20000102021983. The next prime is 20000102022023. The reversal of 20000102022012 is 21022020100002.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2516048614 + ... + 2516056562.
It is an arithmetic number, because the mean of its divisors is an integer number (377549021850).
Almost surely, 220000102022012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20000102022012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27183529573200).
20000102022012 is an abundant number, since it is smaller than the sum of its proper divisors (34366957124388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000102022012 is a wasteful number, since it uses less digits than its factorization.
20000102022012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13820 (or 13811 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 20000102022012 its reverse (21022020100002), we get a palindrome (41022122122014).
The spelling of 20000102022012 in words is "twenty trillion, one hundred two million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •