Base | Representation |
---|---|
bin | 1001001001101000010101… |
… | …01011101010111100100110 |
3 | 2122020122122211001002002220 |
4 | 10210310022223222330212 |
5 | 10114140030324031042 |
6 | 110443544322213210 |
7 | 4144526264303415 |
oct | 444641253527446 |
9 | 78218584032086 |
10 | 20122101002022 |
11 | 645880a485068 |
12 | 230b96aab4206 |
13 | b2c67684a066 |
14 | 4d7cb463147c |
15 | 24d64e5008ec |
hex | 124d0aaeaf26 |
20122101002022 has 8 divisors (see below), whose sum is σ = 40244202004056. Its totient is φ = 6707367000672.
The previous prime is 20122101001943. The next prime is 20122101002027. The reversal of 20122101002022 is 22020010122102.
It is a sphenic number, since it is the product of 3 distinct primes.
20122101002022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 20122101001992 and 20122101002010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20122101002027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1676841750163 + ... + 1676841750174.
It is an arithmetic number, because the mean of its divisors is an integer number (5030525250507).
Almost surely, 220122101002022 is an apocalyptic number.
20122101002022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20122101002022 is a wasteful number, since it uses less digits than its factorization.
20122101002022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3353683500342.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20122101002022 its reverse (22020010122102), we get a palindrome (42142111124124).
The spelling of 20122101002022 in words is "twenty trillion, one hundred twenty-two billion, one hundred one million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •