Base | Representation |
---|---|
bin | 11001000010001110010110… |
… | …011011111111011010110011 |
3 | 112102211211200210202022211012 |
4 | 121002032112123333122303 |
5 | 103412421003200144021 |
6 | 1030101030102541135 |
7 | 32122516010603456 |
oct | 3102162633773263 |
9 | 472754623668735 |
10 | 110104010553011 |
11 | 3209a937608112 |
12 | 10422a8a4377ab |
13 | 49589c0958a97 |
14 | 1d290c38a149d |
15 | cae0d0aa935b |
hex | 6423966ff6b3 |
110104010553011 has 2 divisors, whose sum is σ = 110104010553012. Its totient is φ = 110104010553010.
The previous prime is 110104010552953. The next prime is 110104010553041. The reversal of 110104010553011 is 110355010401011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110104010553011 - 210 = 110104010551987 is a prime.
It is a super-2 number, since 2×1101040105530112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110104010553041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55052005276505 + 55052005276506.
It is an arithmetic number, because the mean of its divisors is an integer number (55052005276506).
Almost surely, 2110104010553011 is an apocalyptic number.
110104010553011 is a deficient number, since it is larger than the sum of its proper divisors (1).
110104010553011 is an equidigital number, since it uses as much as digits as its factorization.
110104010553011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 300, while the sum is 23.
Adding to 110104010553011 its reverse (110355010401011), we get a palindrome (220459020954022).
The spelling of 110104010553011 in words is "one hundred ten trillion, one hundred four billion, ten million, five hundred fifty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •