Base | Representation |
---|---|
bin | 1010000011110011100100… |
… | …11010110010100111100101 |
3 | 2220022202011121102012110111 |
4 | 11001321302122302213211 |
5 | 10344412302301400401 |
6 | 115014125254453021 |
7 | 4442122013532046 |
oct | 501716232624745 |
9 | 86282147365414 |
10 | 22121001200101 |
11 | 7059511536441 |
12 | 2593246664171 |
13 | c4600329c95b |
14 | 56693add48cd |
15 | 285640b85e51 |
hex | 141e726b29e5 |
22121001200101 has 8 divisors (see below), whose sum is σ = 22402933195520. Its totient is φ = 21839117187888.
The previous prime is 22121001200017. The next prime is 22121001200113. The reversal of 22121001200101 is 10100210012122.
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 22121001200101 - 213 = 22121001191909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22121001200201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11067441 + ... + 12912406.
It is an arithmetic number, because the mean of its divisors is an integer number (2800366649440).
Almost surely, 222121001200101 is an apocalyptic number.
It is an amenable number.
22121001200101 is a deficient number, since it is larger than the sum of its proper divisors (281931995419).
22121001200101 is a wasteful number, since it uses less digits than its factorization.
22121001200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23991603.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 22121001200101 its reverse (10100210012122), we get a palindrome (32221211212223).
The spelling of 22121001200101 in words is "twenty-two trillion, one hundred twenty-one billion, one million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •