Base | Representation |
---|---|
bin | 1011101101001110110… |
… | …0101110010000100001 |
3 | 201020010102011100110210 |
4 | 2323103230232100201 |
5 | 11243343233241001 |
6 | 232220544044333 |
7 | 20346642411132 |
oct | 2732354562041 |
9 | 636112140423 |
10 | 201120212001 |
11 | 78327131045 |
12 | 32b8a9036a9 |
13 | 15c72428907 |
14 | 9a3cba1c89 |
15 | 537199ddd6 |
hex | 2ed3b2e421 |
201120212001 has 8 divisors (see below), whose sum is σ = 268860441600. Its totient is φ = 133730061872.
The previous prime is 201120211969. The next prime is 201120212017. The reversal of 201120212001 is 100212021102.
201120212001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 201120212001 - 25 = 201120211969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201120212021) 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 7 ways as a sum of consecutive naturals, for example, 87518526 + ... + 87520823.
It is an arithmetic number, because the mean of its divisors is an integer number (33607555200).
Almost surely, 2201120212001 is an apocalyptic number.
It is an amenable number.
201120212001 is a deficient number, since it is larger than the sum of its proper divisors (67740229599).
201120212001 is a wasteful number, since it uses less digits than its factorization.
201120212001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175039735.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 201120212001 its reverse (100212021102), we get a palindrome (301332233103).
The spelling of 201120212001 in words is "two hundred one billion, one hundred twenty million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •