Base | Representation |
---|---|
bin | 1001001011111001110011… |
… | …1100000011011001010001 |
3 | 1022202120010102010001202122 |
4 | 2102332130330003121101 |
5 | 2310440001340214022 |
6 | 33251531123024025 |
7 | 2061464630562305 |
oct | 222763474033121 |
9 | 38676112101678 |
10 | 10100101101137 |
11 | 3244479842983 |
12 | 117157350b015 |
13 | 5835878a5a08 |
14 | 26cbc1789d05 |
15 | 127ad7e9d742 |
hex | 92f9cf03651 |
10100101101137 has 2 divisors, whose sum is σ = 10100101101138. Its totient is φ = 10100101101136.
The previous prime is 10100101101067. The next prime is 10100101101197. The reversal of 10100101101137 is 73110110100101.
10100101101137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8112562241536 + 1987538859601 = 2848256^2 + 1409801^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100101101137 - 226 = 10100033992273 is a prime.
It is not a weakly prime, because it can be changed into another prime (10100101101197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050050550568 + 5050050550569.
It is an arithmetic number, because the mean of its divisors is an integer number (5050050550569).
Almost surely, 210100101101137 is an apocalyptic number.
It is an amenable number.
10100101101137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100101101137 is an equidigital number, since it uses as much as digits as its factorization.
10100101101137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21, while the sum is 17.
Adding to 10100101101137 its reverse (73110110100101), we get a palindrome (83210211201238).
The spelling of 10100101101137 in words is "ten trillion, one hundred billion, one hundred one million, one hundred one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •