Base | Representation |
---|---|
bin | 1001000110001000101001… |
… | …10100111100100001111100 |
3 | 2121211011200121121212001121 |
4 | 10203010110310330201330 |
5 | 10110203110100334322 |
6 | 110312444132520324 |
7 | 4133045335536322 |
oct | 443042464744174 |
9 | 77734617555047 |
10 | 20002012121212 |
11 | 6411895433530 |
12 | 22b06354800a4 |
13 | b212491132c4 |
14 | 4d216158dd12 |
15 | 24a47183eec7 |
hex | 123114d3c87c |
20002012121212 has 48 divisors (see below), whose sum is σ = 38991297213792. Its totient is φ = 8901823380480.
The previous prime is 20002012121191. The next prime is 20002012121293. The reversal of 20002012121212 is 21212121020002.
It is a happy number.
It is a super-2 number, since 2×200020121212122 (a number of 27 digits) contains 22 as substring.
20002012121212 is a modest number, since divided by 12121212 gives 200020 as remainder.
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, 22287243 + ... + 23167330.
It is an arithmetic number, because the mean of its divisors is an integer number (812318691954).
Almost surely, 220002012121212 is an apocalyptic number.
20002012121212 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
20002012121212 is a deficient number, since it is larger than the sum of its proper divisors (18989285092580).
20002012121212 is a wasteful number, since it uses less digits than its factorization.
20002012121212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45454798 (or 45454796 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20002012121212 its reverse (21212121020002), we get a palindrome (41214133141214).
The spelling of 20002012121212 in words is "twenty trillion, two billion, twelve million, one hundred twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •