Base | Representation |
---|---|
bin | 10110101111010101100101… |
… | …001011111000001110110001 |
3 | 111010002212022121222002212012 |
4 | 112233111211023320032301 |
5 | 101102031000320200311 |
6 | 552411544223212305 |
7 | 30031325210115035 |
oct | 2657254513701661 |
9 | 433085277862765 |
10 | 100010011100081 |
11 | 2995900a012905 |
12 | b27273a447095 |
13 | 43a5b9921b8c4 |
14 | 1a9a7206241c5 |
15 | b8675362178b |
hex | 5af5652f83b1 |
100010011100081 has 2 divisors, whose sum is σ = 100010011100082. Its totient is φ = 100010011100080.
The previous prime is 100010011100057. The next prime is 100010011100099. The reversal of 100010011100081 is 180001110010001.
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., 56606949490081 + 43403061610000 = 7523759^2 + 6588100^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100010011100081 is a prime.
It is a super-2 number, since 2×1000100111000812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100010011100011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005005550040 + 50005005550041.
It is an arithmetic number, because the mean of its divisors is an integer number (50005005550041).
Almost surely, 2100010011100081 is an apocalyptic number.
It is an amenable number.
100010011100081 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010011100081 is an equidigital number, since it uses as much as digits as its factorization.
100010011100081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 100010011100081 its reverse (180001110010001), we get a palindrome (280011121110082).
The spelling of 100010011100081 in words is "one hundred trillion, ten billion, eleven million, one hundred thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •