Base | Representation |
---|---|
bin | 101101101110011001111111… |
… | …101111111010110000110001 |
3 | 222101001002002120022021202110 |
4 | 231232121333233322300301 |
5 | 202324320024103014301 |
6 | 1551412323150435533 |
7 | 60234034531021533 |
oct | 5556317757726061 |
9 | 871032076267673 |
10 | 201101102001201 |
11 | 59093553426136 |
12 | 1a67a8a8202ba9 |
13 | 88299a246896c |
14 | 37934b95cb853 |
15 | 183b17b66e0d6 |
hex | b6e67fbfac31 |
201101102001201 has 32 divisors (see below), whose sum is σ = 287576245607040. Its totient is φ = 124613195226624.
The previous prime is 201101102001197. The next prime is 201101102001229. The reversal of 201101102001201 is 102100201101102.
It is not a de Polignac number, because 201101102001201 - 22 = 201101102001197 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201101102001271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 263754415 + ... + 264515771.
It is an arithmetic number, because the mean of its divisors is an integer number (8986757675220).
Almost surely, 2201101102001201 is an apocalyptic number.
It is an amenable number.
201101102001201 is a deficient number, since it is larger than the sum of its proper divisors (86475143605839).
201101102001201 is a wasteful number, since it uses less digits than its factorization.
201101102001201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 848865.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201101102001201 its reverse (102100201101102), we get a palindrome (303201303102303).
Subtracting from 201101102001201 its reverse (102100201101102), we obtain a palindrome (99000900900099).
The spelling of 201101102001201 in words is "two hundred one trillion, one hundred one billion, one hundred two million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •