Base | Representation |
---|---|
bin | 100000000001110110100… |
… | …010011101100101100010 |
3 | 21210102012022101112000112 |
4 | 200001312202131211202 |
5 | 242030133033013442 |
6 | 4403044141451322 |
7 | 315006062215454 |
oct | 40016642354542 |
9 | 7712168345015 |
10 | 2201012001122 |
11 | 779497992450 |
12 | 2b66a2570b42 |
13 | 12c72943307c |
14 | 7875b1242d4 |
15 | 3c3c0204082 |
hex | 2007689d962 |
2201012001122 has 8 divisors (see below), whose sum is σ = 3601656001872. Its totient is φ = 1000460000500.
The previous prime is 2201012001053. The next prime is 2201012001127. The reversal of 2201012001122 is 2211002101022.
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 = 2201012001097 and 2201012001106.
It is not an unprimeable number, because it can be changed into a prime (2201012001127) 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, 50023000004 + ... + 50023000047.
It is an arithmetic number, because the mean of its divisors is an integer number (450207000234).
Almost surely, 22201012001122 is an apocalyptic number.
2201012001122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2201012001122 is a deficient number, since it is larger than the sum of its proper divisors (1400644000750).
2201012001122 is a wasteful number, since it uses less digits than its factorization.
2201012001122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100046000064.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2201012001122 its reverse (2211002101022), we get a palindrome (4412014102144).
The spelling of 2201012001122 in words is "two trillion, two hundred one billion, twelve million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •