Base | Representation |
---|---|
bin | 11001000000101110100000… |
… | …100011100111101011110001 |
3 | 112102111000001212110222001222 |
4 | 121000232200203213223301 |
5 | 103404224223341010001 |
6 | 1025541450324234425 |
7 | 32112213555015023 |
oct | 3100564043475361 |
9 | 472430055428058 |
10 | 110001101110001 |
11 | 32060228943462 |
12 | 10406b4a23ba15 |
13 | 494c0a045043a |
14 | 1d2412028c013 |
15 | cab5ab21761b |
hex | 640ba08e7af1 |
110001101110001 has 2 divisors, whose sum is σ = 110001101110002. Its totient is φ = 110001101110000.
The previous prime is 110001101109979. The next prime is 110001101110013. The reversal of 110001101110001 is 100011101100011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63985920774400 + 46015180335601 = 7999120^2 + 6783449^2 .
It is an emirp because it is prime and its reverse (100011101100011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110001101110001 - 214 = 110001101093617 is a prime.
It is not a weakly prime, because it can be changed into another prime (110001101118001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000550555000 + 55000550555001.
It is an arithmetic number, because the mean of its divisors is an integer number (55000550555001).
Almost surely, 2110001101110001 is an apocalyptic number.
It is an amenable number.
110001101110001 is a deficient number, since it is larger than the sum of its proper divisors (1).
110001101110001 is an equidigital number, since it uses as much as digits as its factorization.
110001101110001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 110001101110001 its reverse (100011101100011), we get a palindrome (210012202210012).
The spelling of 110001101110001 in words is "one hundred ten trillion, one billion, one hundred one million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •