Base | Representation |
---|---|
bin | 10110101111001100010000… |
… | …011110111110110110111011 |
3 | 111010001220110221112010012012 |
4 | 112233030100132332312323 |
5 | 101101400000012010021 |
6 | 552403211005040135 |
7 | 30030522140111051 |
oct | 2657142036766673 |
9 | 433056427463165 |
10 | 100000000110011 |
11 | 299548420818a1 |
12 | b27080585604b |
13 | 43a4c62184041 |
14 | 1a9a050c401d1 |
15 | b863697e235b |
hex | 5af3107bedbb |
100000000110011 has 2 divisors, whose sum is σ = 100000000110012. Its totient is φ = 100000000110010.
The previous prime is 100000000109981. The next prime is 100000000110029. The reversal of 100000000110011 is 110011000000001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100000000110011 - 226 = 99999933001147 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100000000109977 and 100000000110004.
It is not a weakly prime, because it can be changed into another prime (100000000130011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000000055005 + 50000000055006.
It is an arithmetic number, because the mean of its divisors is an integer number (50000000055006).
Almost surely, 2100000000110011 is an apocalyptic number.
100000000110011 is a deficient number, since it is larger than the sum of its proper divisors (1).
100000000110011 is an equidigital number, since it uses as much as digits as its factorization.
100000000110011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 100000000110011 its reverse (110011000000001), we get a palindrome (210011000110012).
The spelling of 100000000110011 in words is "one hundred trillion, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •