Base | Representation |
---|---|
bin | 11110111000010001000… |
… | …100000001001001111001 |
3 | 21111212020211120120212010 |
4 | 132320101010001021321 |
5 | 234231324012011301 |
6 | 4302500002440133 |
7 | 306211066221366 |
oct | 36702104011171 |
9 | 7455224516763 |
10 | 2122000110201 |
11 | 748a31818344 |
12 | 2a3311663049 |
13 | 125146c33caa |
14 | 749c36bd46d |
15 | 3a2e88685d6 |
hex | 1ee11101279 |
2122000110201 has 8 divisors (see below), whose sum is σ = 2845139813280. Its totient is φ = 1406763573632.
The previous prime is 2122000110193. The next prime is 2122000110227. The reversal of 2122000110201 is 1020110002212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2122000110201 - 23 = 2122000110193 is a prime.
It is a super-2 number, since 2×21220001102012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2122000110101) 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 7 ways as a sum of consecutive naturals, for example, 1975791000 + ... + 1975792073.
It is an arithmetic number, because the mean of its divisors is an integer number (355642476660).
Almost surely, 22122000110201 is an apocalyptic number.
It is an amenable number.
2122000110201 is a deficient number, since it is larger than the sum of its proper divisors (723139703079).
2122000110201 is a wasteful number, since it uses less digits than its factorization.
2122000110201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3951583255.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2122000110201 its reverse (1020110002212), we get a palindrome (3142110112413).
The spelling of 2122000110201 in words is "two trillion, one hundred twenty-two billion, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •