Base | Representation |
---|---|
bin | 1001001001000010111011… |
… | …11000010111000111100001 |
3 | 2122011201211110212010222212 |
4 | 10210201131320113013201 |
5 | 10113322420113013441 |
6 | 110430424051411505 |
7 | 4143215562514244 |
oct | 444413570270741 |
9 | 78151743763885 |
10 | 20102022001121 |
11 | 64502463a7545 |
12 | 2307aa65b3b95 |
13 | b2a7c69a1a38 |
14 | 4d6d2ba6325b |
15 | 24cd7687beeb |
hex | 12485de171e1 |
20102022001121 has 16 divisors (see below), whose sum is σ = 20662189067520. Its totient is φ = 19546103472000.
The previous prime is 20102022001109. The next prime is 20102022001177. The reversal of 20102022001121 is 12110022020102.
It is a cyclic number.
It is not a de Polignac number, because 20102022001121 - 26 = 20102022001057 is a prime.
It is a super-3 number, since 3×201020220011213 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20102022001096 and 20102022001105.
It is not an unprimeable number, because it can be changed into a prime (20102022001421) 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, 47389115 + ... + 47811423.
It is an arithmetic number, because the mean of its divisors is an integer number (1291386816720).
Almost surely, 220102022001121 is an apocalyptic number.
It is an amenable number.
20102022001121 is a deficient number, since it is larger than the sum of its proper divisors (560167066399).
20102022001121 is a wasteful number, since it uses less digits than its factorization.
20102022001121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 427336.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20102022001121 its reverse (12110022020102), we get a palindrome (32212044021223).
The spelling of 20102022001121 in words is "twenty trillion, one hundred two billion, twenty-two million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •