Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …0100101110011111010101 |
3 | 1022202112220010202112120112 |
4 | 2102332113210232133111 |
5 | 2310434310320200432 |
6 | 33251514150012405 |
7 | 2061462455563541 |
oct | 222762744563725 |
9 | 38675803675515 |
10 | 10100011100117 |
11 | 3244432a60874 |
12 | 1171549347105 |
13 | 583572053483 |
14 | 26cbb383ca21 |
15 | 127ad01217b2 |
hex | 92f9792e7d5 |
10100011100117 has 2 divisors, whose sum is σ = 10100011100118. Its totient is φ = 10100011100116.
The previous prime is 10100011100093. The next prime is 10100011100197. The reversal of 10100011100117 is 71100111000101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7436698074961 + 2663313025156 = 2727031^2 + 1631966^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10100011100117 is a prime.
It is a super-2 number, since 2×101000111001172 (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 (10100011100197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050005550058 + 5050005550059.
It is an arithmetic number, because the mean of its divisors is an integer number (5050005550059).
Almost surely, 210100011100117 is an apocalyptic number.
It is an amenable number.
10100011100117 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100011100117 is an equidigital number, since it uses as much as digits as its factorization.
10100011100117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7, while the sum is 14.
Adding to 10100011100117 its reverse (71100111000101), we get a palindrome (81200122100218).
The spelling of 10100011100117 in words is "ten trillion, one hundred billion, eleven million, one hundred thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •