Base | Representation |
---|---|
bin | 10010101000001110… |
… | …01011010100010101 |
3 | 221210222211121220221 |
4 | 21110013023110111 |
5 | 130440240231401 |
6 | 4332222154341 |
7 | 502556652034 |
oct | 112407132425 |
9 | 27728747827 |
10 | 10001102101 |
11 | 42723a8041 |
12 | 1b314229b1 |
13 | c34cb4cc3 |
14 | 6ac36c71b |
15 | 3d80297a1 |
hex | 2541cb515 |
10001102101 has 2 divisors, whose sum is σ = 10001102102. Its totient is φ = 10001102100.
The previous prime is 10001102093. The next prime is 10001102117. The reversal of 10001102101 is 10120110001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5658951076 + 4342151025 = 75226^2 + 65895^2 .
It is an emirp because it is prime and its reverse (10120110001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10001102101 - 23 = 10001102093 is a prime.
It is a super-2 number, since 2×100011021012 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10001102131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000551050 + 5000551051.
It is an arithmetic number, because the mean of its divisors is an integer number (5000551051).
Almost surely, 210001102101 is an apocalyptic number.
It is an amenable number.
10001102101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001102101 is an equidigital number, since it uses as much as digits as its factorization.
10001102101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 10001102101 its reverse (10120110001), we get a palindrome (20121212102).
The spelling of 10001102101 in words is "ten billion, one million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •