Base | Representation |
---|---|
bin | 1001001001101000010110… |
… | …01110011101010000101000 |
3 | 2122020122200110012100222211 |
4 | 10210310023032131100220 |
5 | 10114140040142333000 |
6 | 110443545245454504 |
7 | 4144526434643356 |
oct | 444641316352050 |
9 | 78218613170884 |
10 | 20122110121000 |
11 | 6458814643308 |
12 | 230b971b71434 |
13 | b2c6786c08c4 |
14 | 4d7cb59267d6 |
15 | 24d6502027ba |
hex | 124d0b39d428 |
20122110121000 has 32 divisors (see below), whose sum is σ = 47085737685480. Its totient is φ = 8048844048000.
The previous prime is 20122110120991. The next prime is 20122110121073. The reversal of 20122110121000 is 12101122102.
It can be written as a sum of positive squares in 4 ways, for example, as 4407371191876 + 15714738929124 = 2099374^2 + 3964182^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10061054061 + ... + 10061056060.
Almost surely, 220122110121000 is an apocalyptic number.
20122110121000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20122110121000 is an abundant number, since it is smaller than the sum of its proper divisors (26963627564480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20122110121000 is a wasteful number, since it uses less digits than its factorization.
20122110121000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20122110142 (or 20122110128 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20122110121000 its reverse (12101122102), we get a palindrome (20134211243102).
The spelling of 20122110121000 in words is "twenty trillion, one hundred twenty-two billion, one hundred ten million, one hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •