Base | Representation |
---|---|
bin | 1001000110101110000100… |
… | …01010100101010110110011 |
3 | 2121220002112120201222100011 |
4 | 10203113002022211112303 |
5 | 10111020230112333021 |
6 | 110330005324235351 |
7 | 4134356206655362 |
oct | 443270212452663 |
9 | 77802476658304 |
10 | 20022100121011 |
11 | 641a3635a805a |
12 | 22b450099bb57 |
13 | b230caabc611 |
14 | 4d31094217d9 |
15 | 24ac4a18ede1 |
hex | 1235c22a55b3 |
20022100121011 has 16 divisors (see below), whose sum is σ = 20154063406464. Its totient is φ = 19890696518784.
The previous prime is 20022100120999. The next prime is 20022100121017. The reversal of 20022100121011 is 11012100122002.
It is a cyclic number.
It is not a de Polignac number, because 20022100121011 - 229 = 20021563250099 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20022100120982 and 20022100121000.
It is not an unprimeable number, because it can be changed into a prime (20022100121017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 103686396 + ... + 103879318.
It is an arithmetic number, because the mean of its divisors is an integer number (1259628962904).
Almost surely, 220022100121011 is an apocalyptic number.
20022100121011 is a deficient number, since it is larger than the sum of its proper divisors (131963285453).
20022100121011 is a wasteful number, since it uses less digits than its factorization.
20022100121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194370.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20022100121011 its reverse (11012100122002), we get a palindrome (31034200243013).
Subtracting from 20022100121011 its reverse (11012100122002), we obtain a palindrome (9009999999009).
The spelling of 20022100121011 in words is "twenty trillion, twenty-two billion, one hundred million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •