Base | Representation |
---|---|
bin | 11101010000000100100… |
… | …000000110110101110110 |
3 | 21010011110201211021221212 |
4 | 131100010200012311312 |
5 | 230413211234020042 |
6 | 4135234140241422 |
7 | 265140436645505 |
oct | 35200440066566 |
9 | 7104421737855 |
10 | 2010120220022 |
11 | 70553a507992 |
12 | 2856a9240272 |
13 | 117727124945 |
14 | 6d40c98883c |
15 | 3744b6d6482 |
hex | 1d404806d76 |
2010120220022 has 8 divisors (see below), whose sum is σ = 3017216242872. Its totient is φ = 1004381472400.
The previous prime is 2010120220021. The next prime is 2010120220037. The reversal of 2010120220022 is 2200220210102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 2010120219979 and 2010120220006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010120220021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 339315104 + ... + 339321027.
It is an arithmetic number, because the mean of its divisors is an integer number (377152030359).
Almost surely, 22010120220022 is an apocalyptic number.
2010120220022 is a deficient number, since it is larger than the sum of its proper divisors (1007096022850).
2010120220022 is a wasteful number, since it uses less digits than its factorization.
2010120220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 678637614.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 2010120220022 its reverse (2200220210102), we get a palindrome (4210340430124).
The spelling of 2010120220022 in words is "two trillion, ten billion, one hundred twenty million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •