Base | Representation |
---|---|
bin | 101101101110011010000110… |
… | …001100101100111101001001 |
3 | 222101001002101002220212111020 |
4 | 231232122012030230331021 |
5 | 202324320234303210441 |
6 | 1551412342014023053 |
7 | 60234040313543454 |
oct | 5556320614547511 |
9 | 871032332825436 |
10 | 201101210210121 |
11 | 590935a95140a1 |
12 | 1a67a9184a7a89 |
13 | 88299bb9c4a00 |
14 | 37934c9b1849b |
15 | 183b185de5e66 |
hex | b6e68632cf49 |
201101210210121 has 24 divisors (see below), whose sum is σ = 291395494851840. Its totient is φ = 123307823336256.
The previous prime is 201101210210041. The next prime is 201101210210177. The reversal of 201101210210121 is 121012012101102.
It is a happy number.
It is not a de Polignac number, because 201101210210121 - 225 = 201101176655689 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201101210210121.
It is not an unprimeable number, because it can be changed into a prime (201101210210321) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 715833081 + ... + 716113958.
It is an arithmetic number, because the mean of its divisors is an integer number (12141478952160).
Almost surely, 2201101210210121 is an apocalyptic number.
It is an amenable number.
201101210210121 is a deficient number, since it is larger than the sum of its proper divisors (90294284641719).
201101210210121 is a wasteful number, since it uses less digits than its factorization.
201101210210121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1431947345 (or 1431947332 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 201101210210121 its reverse (121012012101102), we get a palindrome (322113222311223).
The spelling of 201101210210121 in words is "two hundred one trillion, one hundred one billion, two hundred ten million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •