Base | Representation |
---|---|
bin | 10010110100000001… |
… | …10111011100001001 |
3 | 222001220010210202101 |
4 | 21122000313130021 |
5 | 131141112023423 |
6 | 4350120233401 |
7 | 505201346041 |
oct | 113200673411 |
9 | 28056123671 |
10 | 10100111113 |
11 | 4313281a74 |
12 | 1b5a60b861 |
13 | c4c66c711 |
14 | 6bb582721 |
15 | 3e1a857ad |
hex | 25a037709 |
10100111113 has 2 divisors, whose sum is σ = 10100111114. Its totient is φ = 10100111112.
The previous prime is 10100111101. The next prime is 10100111137. The reversal of 10100111113 is 31111100101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10078553664 + 21557449 = 100392^2 + 4643^2 .
It is an emirp because it is prime and its reverse (31111100101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10100111113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10100111113.
It is not a weakly prime, because it can be changed into another prime (10100111513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050055556 + 5050055557.
It is an arithmetic number, because the mean of its divisors is an integer number (5050055557).
Almost surely, 210100111113 is an apocalyptic number.
It is an amenable number.
10100111113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100111113 is an equidigital number, since it uses as much as digits as its factorization.
10100111113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 10100111113 its reverse (31111100101), we get a palindrome (41211211214).
The spelling of 10100111113 in words is "ten billion, one hundred million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •