Base | Representation |
---|---|
bin | 1001001011111101001010… |
… | …0101101111000000000101 |
3 | 1022202122110010211211212001 |
4 | 2102333102211233000011 |
5 | 2310443322303020401 |
6 | 33252200315425301 |
7 | 2061526140504661 |
oct | 222772245570005 |
9 | 38678403754761 |
10 | 10101001220101 |
11 | 32448a0946650 |
12 | 1171784a55231 |
13 | 58369c21159c |
14 | 26cc691378a1 |
15 | 127b3c000601 |
hex | 92fd296f005 |
10101001220101 has 8 divisors (see below), whose sum is σ = 11062150614144. Its totient is φ = 9146997918720.
The previous prime is 10101001220083. The next prime is 10101001220159. The reversal of 10101001220101 is 10102210010101.
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 10101001220101 - 231 = 10098853736453 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 (10101001220201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1786520205 + ... + 1786525858.
It is an arithmetic number, because the mean of its divisors is an integer number (1382768826768).
Almost surely, 210101001220101 is an apocalyptic number.
10101001220101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10101001220101 is a deficient number, since it is larger than the sum of its proper divisors (961149394043).
10101001220101 is a wasteful number, since it uses less digits than its factorization.
10101001220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3573046331.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10101001220101 its reverse (10102210010101), we get a palindrome (20203211230202).
The spelling of 10101001220101 in words is "ten trillion, one hundred one billion, one million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •