Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …101011011110111010101011 |
3 | 111020121111221022202001011012 |
4 | 112331233223223132322223 |
5 | 101214241211130310102 |
6 | 554450450543054135 |
7 | 30163005611024234 |
oct | 2675575353367253 |
9 | 436544838661135 |
10 | 101000110010027 |
11 | 2a1aa9a7040248 |
12 | b3b25b85a134b |
13 | 444836714b577 |
14 | 1ad2607ad408b |
15 | ba23a0a16752 |
hex | 5bdbebadeeab |
101000110010027 has 2 divisors, whose sum is σ = 101000110010028. Its totient is φ = 101000110010026.
The previous prime is 101000110009957. The next prime is 101000110010029. The reversal of 101000110010027 is 720010011000101.
It is a strong prime.
It is an emirp because it is prime and its reverse (720010011000101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101000110010027 - 236 = 100931390533291 is a prime.
Together with 101000110010029, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 101000110009993 and 101000110010020.
It is not a weakly prime, because it can be changed into another prime (101000110010029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500055005013 + 50500055005014.
It is an arithmetic number, because the mean of its divisors is an integer number (50500055005014).
Almost surely, 2101000110010027 is an apocalyptic number.
101000110010027 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000110010027 is an equidigital number, since it uses as much as digits as its factorization.
101000110010027 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 101000110010027 its reverse (720010011000101), we get a palindrome (821010121010128).
The spelling of 101000110010027 in words is "one hundred one trillion, one hundred ten million, ten thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •