Base | Representation |
---|---|
bin | 1001001100011110101100… |
… | …0001001011001001000011 |
3 | 1022210111200100112002100112 |
4 | 2103013223001023021003 |
5 | 2311120240224013102 |
6 | 33300245332141535 |
7 | 2062265151414224 |
oct | 223075301131103 |
9 | 38714610462315 |
10 | 10110001001027 |
11 | 3248699aa8224 |
12 | 1173476a678ab |
13 | 5844a4915c45 |
14 | 26d4804d324b |
15 | 127eb7187252 |
hex | 931eb04b243 |
10110001001027 has 2 divisors, whose sum is σ = 10110001001028. Its totient is φ = 10110001001026.
The previous prime is 10110001000973. The next prime is 10110001001041. The reversal of 10110001001027 is 72010010001101.
It is an a-pointer prime, because the next prime (10110001001041) can be obtained adding 10110001001027 to its sum of digits (14).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10110001001027 - 230 = 10108927259203 is a prime.
It is not a weakly prime, because it can be changed into another prime (10110001001627) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055000500513 + 5055000500514.
It is an arithmetic number, because the mean of its divisors is an integer number (5055000500514).
Almost surely, 210110001001027 is an apocalyptic number.
10110001001027 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110001001027 is an equidigital number, since it uses as much as digits as its factorization.
10110001001027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 14.
Adding to 10110001001027 its reverse (72010010001101), we get a palindrome (82120011002128).
The spelling of 10110001001027 in words is "ten trillion, one hundred ten billion, one million, one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •