Base | Representation |
---|---|
bin | 10110101111010110100000… |
… | …101110110000101101110001 |
3 | 111010002221220020202120020012 |
4 | 112233112200232300231301 |
5 | 101102040022041200311 |
6 | 552412231311224305 |
7 | 30031362030352343 |
oct | 2657264056605561 |
9 | 433087806676205 |
10 | 100011010100081 |
11 | 29959481a13343 |
12 | b272978b18095 |
13 | 43a5cc8198872 |
14 | 1a9a7b7191293 |
15 | b867b11a678b |
hex | 5af5a0bb0b71 |
100011010100081 has 2 divisors, whose sum is σ = 100011010100082. Its totient is φ = 100011010100080.
The previous prime is 100011010100017. The next prime is 100011010100101. The reversal of 100011010100081 is 180001010110001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99739370041600 + 271640058481 = 9986960^2 + 521191^2 .
It is a cyclic number.
It is not a de Polignac number, because 100011010100081 - 26 = 100011010100017 is a prime.
It is a super-2 number, since 2×1000110101000812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100011010120081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005505050040 + 50005505050041.
It is an arithmetic number, because the mean of its divisors is an integer number (50005505050041).
Almost surely, 2100011010100081 is an apocalyptic number.
It is an amenable number.
100011010100081 is a deficient number, since it is larger than the sum of its proper divisors (1).
100011010100081 is an equidigital number, since it uses as much as digits as its factorization.
100011010100081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 100011010100081 its reverse (180001010110001), we get a palindrome (280012020210082).
The spelling of 100011010100081 in words is "one hundred trillion, eleven billion, ten million, one hundred thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •