Base | Representation |
---|---|
bin | 1001001100100001001000… |
… | …01000011100011111101010 |
3 | 2122121010202000110022020112 |
4 | 10212100210020130133222 |
5 | 10122301221412120320 |
6 | 111001313111054322 |
7 | 4154640652622300 |
oct | 446204410343752 |
9 | 78533660408215 |
10 | 20221312223210 |
11 | 64968a0643a4a |
12 | 23270386713a2 |
13 | b38b27b05277 |
14 | 4dca06a08270 |
15 | 25100937cec5 |
hex | 12642421c7ea |
20221312223210 has 48 divisors (see below), whose sum is σ = 42425803836000. Its totient is φ = 6919127419680.
The previous prime is 20221312223141. The next prime is 20221312223279. The reversal of 20221312223210 is 1232221312202.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (20221312223141) and next prime (20221312223279).
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 23 ways as a sum of consecutive naturals, for example, 41106176 + ... + 41595195.
It is an arithmetic number, because the mean of its divisors is an integer number (883870913250).
Almost surely, 220221312223210 is an apocalyptic number.
20221312223210 is an abundant number, since it is smaller than the sum of its proper divisors (22204491612790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20221312223210 is a wasteful number, since it uses less digits than its factorization.
20221312223210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82701891 (or 82701884 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 20221312223210 its reverse (1232221312202), we get a palindrome (21453533535412).
The spelling of 20221312223210 in words is "twenty trillion, two hundred twenty-one billion, three hundred twelve million, two hundred twenty-three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •