Base | Representation |
---|---|
bin | 10110111101110000101101… |
… | …111010011010011101101001 |
3 | 111020121121210202200100221120 |
4 | 112331300231322122131221 |
5 | 101214301000113021301 |
6 | 554451153120125453 |
7 | 30163045263120111 |
oct | 2675605572323551 |
9 | 436547722610846 |
10 | 101001221220201 |
11 | 2a200417311965 |
12 | b3b2868766889 |
13 | 44484b3425893 |
14 | 1ad26b1510041 |
15 | ba2418363e36 |
hex | 5bdc2de9a769 |
101001221220201 has 4 divisors (see below), whose sum is σ = 134668294960272. Its totient is φ = 67334147480132.
The previous prime is 101001221220169. The next prime is 101001221220217. The reversal of 101001221220201 is 102022122100101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101001221220201 - 25 = 101001221220169 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101001221220001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16833536870031 + ... + 16833536870036.
It is an arithmetic number, because the mean of its divisors is an integer number (33667073740068).
Almost surely, 2101001221220201 is an apocalyptic number.
It is an amenable number.
101001221220201 is a deficient number, since it is larger than the sum of its proper divisors (33667073740071).
101001221220201 is an equidigital number, since it uses as much as digits as its factorization.
101001221220201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33667073740070.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101001221220201 its reverse (102022122100101), we get a palindrome (203023343320302).
The spelling of 101001221220201 in words is "one hundred one trillion, one billion, two hundred twenty-one million, two hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •