Base | Representation |
---|---|
bin | 1001000110001000110100… |
… | …01100010001001011111011 |
3 | 2121211011220212222022211220 |
4 | 10203010122030101023323 |
5 | 10110203301120334321 |
6 | 110312501105523123 |
7 | 4133050510532100 |
oct | 443043214211373 |
9 | 77734825868756 |
10 | 20002102121211 |
11 | 64119312148a1 |
12 | 22b065b6434a3 |
13 | b21261965242 |
14 | 4d216d4daaa7 |
15 | 24a4796bb9c6 |
hex | 12311a3112fb |
20002102121211 has 48 divisors (see below), whose sum is σ = 31357256426496. Its totient is φ = 11306975307264.
The previous prime is 20002102121171. The next prime is 20002102121227. The reversal of 20002102121211 is 11212120120002.
It is not a de Polignac number, because 20002102121211 - 26 = 20002102121147 is a prime.
It is a super-2 number, since 2×200021021212112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20002102141211) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 32303650 + ... + 32917016.
It is an arithmetic number, because the mean of its divisors is an integer number (653276175552).
Almost surely, 220002102121211 is an apocalyptic number.
20002102121211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20002102121211 is a deficient number, since it is larger than the sum of its proper divisors (11355154305285).
20002102121211 is a wasteful number, since it uses less digits than its factorization.
20002102121211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 615768 (or 615761 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20002102121211 its reverse (11212120120002), we get a palindrome (31214222241213).
The spelling of 20002102121211 in words is "twenty trillion, two billion, one hundred two million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •