Base | Representation |
---|---|
bin | 11001000100010000110111… |
… | …000010110000010111100011 |
3 | 112110100020101221121011222201 |
4 | 121010100313002300113203 |
5 | 103422220001332214021 |
6 | 1030245243253314031 |
7 | 32135606442465235 |
oct | 3104206702602743 |
9 | 473306357534881 |
10 | 110244144023011 |
11 | 32144308273239 |
12 | 10446078935917 |
13 | 4968c9407cabb |
14 | 1d31bb8b14255 |
15 | cb2a83392591 |
hex | 6444370b05e3 |
110244144023011 has 2 divisors, whose sum is σ = 110244144023012. Its totient is φ = 110244144023010.
The previous prime is 110244144022993. The next prime is 110244144023029. The reversal of 110244144023011 is 110320441442011.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (110244144022993) and next prime (110244144023029).
It is a cyclic number.
It is not a de Polignac number, because 110244144023011 - 239 = 109694388209123 is a prime.
It is a super-2 number, since 2×1102441440230112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110244144020011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55122072011505 + 55122072011506.
It is an arithmetic number, because the mean of its divisors is an integer number (55122072011506).
Almost surely, 2110244144023011 is an apocalyptic number.
110244144023011 is a deficient number, since it is larger than the sum of its proper divisors (1).
110244144023011 is an equidigital number, since it uses as much as digits as its factorization.
110244144023011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 110244144023011 its reverse (110320441442011), we get a palindrome (220564585465022).
The spelling of 110244144023011 in words is "one hundred ten trillion, two hundred forty-four billion, one hundred forty-four million, twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •