Base | Representation |
---|---|
bin | 11101000110110000011… |
… | …101001001000110101010 |
3 | 21002012122211001202201021 |
4 | 131012300131021012222 |
5 | 230232221234101442 |
6 | 4130501553443054 |
7 | 264334562242621 |
oct | 35066035110652 |
9 | 7065584052637 |
10 | 2000120222122 |
11 | 7012787a4510 |
12 | 28377827048a |
13 | 1167c2438419 |
14 | 6cb408266b8 |
15 | 37063828e67 |
hex | 1d1b07491aa |
2000120222122 has 8 divisors (see below), whose sum is σ = 3272923999872. Its totient is φ = 909145555500.
The previous prime is 2000120222117. The next prime is 2000120222123. The reversal of 2000120222122 is 2212220210002.
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 = 2000120222096 and 2000120222105.
It is not an unprimeable number, because it can be changed into a prime (2000120222123) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 45457277754 + ... + 45457277797.
It is an arithmetic number, because the mean of its divisors is an integer number (409115499984).
Almost surely, 22000120222122 is an apocalyptic number.
2000120222122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2000120222122 is a deficient number, since it is larger than the sum of its proper divisors (1272803777750).
2000120222122 is a wasteful number, since it uses less digits than its factorization.
2000120222122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90914555564.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 2000120222122 its reverse (2212220210002), we get a palindrome (4212340432124).
The spelling of 2000120222122 in words is "two trillion, one hundred twenty million, two hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •