Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …1011101001000110001101 |
3 | 1022102221211221010021221002 |
4 | 2101222221023221012031 |
5 | 2303001202210413401 |
6 | 33142325420350045 |
7 | 2052130624546205 |
oct | 221525113510615 |
9 | 38387757107832 |
10 | 10010112201101 |
11 | 320a2a0413411 |
12 | 115803a3a5325 |
13 | 577c4616bb7c |
14 | 2686c613b405 |
15 | 1255bcab5a6b |
hex | 91aa92e918d |
10010112201101 has 2 divisors, whose sum is σ = 10010112201102. Its totient is φ = 10010112201100.
The previous prime is 10010112201071. The next prime is 10010112201149. The reversal of 10010112201101 is 10110221101001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6910857580201 + 3099254620900 = 2628851^2 + 1760470^2 .
It is a cyclic number.
It is not a de Polignac number, because 10010112201101 - 214 = 10010112184717 is a prime.
It is a super-2 number, since 2×100101122011012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10010112201601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005056100550 + 5005056100551.
It is an arithmetic number, because the mean of its divisors is an integer number (5005056100551).
Almost surely, 210010112201101 is an apocalyptic number.
It is an amenable number.
10010112201101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010112201101 is an equidigital number, since it uses as much as digits as its factorization.
10010112201101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10010112201101 its reverse (10110221101001), we get a palindrome (20120333302102).
The spelling of 10010112201101 in words is "ten trillion, ten billion, one hundred twelve million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •