Base | Representation |
---|---|
bin | 11001000000110110110011… |
… | …101000100100101011000001 |
3 | 112102111212001211012212101221 |
4 | 121000312303220210223001 |
5 | 103404401000321010311 |
6 | 1025545522412355041 |
7 | 32112650425533445 |
oct | 3100666350445301 |
9 | 472455054185357 |
10 | 110010011110081 |
11 | 32063a90353395 |
12 | 10408816175a81 |
13 | 494cb9037b834 |
14 | 1d24727756825 |
15 | cab92d567671 |
hex | 640db3a24ac1 |
110010011110081 has 2 divisors, whose sum is σ = 110010011110082. Its totient is φ = 110010011110080.
The previous prime is 110010011109857. The next prime is 110010011110147. The reversal of 110010011110081 is 180011110010011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97296621849025 + 12713389261056 = 9863905^2 + 3565584^2 .
It is a cyclic number.
It is not a de Polignac number, because 110010011110081 - 215 = 110010011077313 is a prime.
It is a super-2 number, since 2×1100100111100812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110010011117081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005005555040 + 55005005555041.
It is an arithmetic number, because the mean of its divisors is an integer number (55005005555041).
Almost surely, 2110010011110081 is an apocalyptic number.
It is an amenable number.
110010011110081 is a deficient number, since it is larger than the sum of its proper divisors (1).
110010011110081 is an equidigital number, since it uses as much as digits as its factorization.
110010011110081 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 16.
Adding to 110010011110081 its reverse (180011110010011), we get a palindrome (290021121120092).
The spelling of 110010011110081 in words is "one hundred ten trillion, ten billion, eleven million, one hundred ten thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •