Base | Representation |
---|---|
bin | 11001000110100101110110… |
… | …000000100110100110111111 |
3 | 112110220112022112201211202200 |
4 | 121012211312000212212333 |
5 | 103432330111214311221 |
6 | 1030450541101522543 |
7 | 32153301604614552 |
oct | 3106456600464677 |
9 | 473815275654680 |
10 | 110404114213311 |
11 | 321a6138275986 |
12 | 10471082573453 |
13 | 497b0a90b0239 |
14 | 1d398326a8699 |
15 | cb6ce73e2426 |
hex | 6469760269bf |
110404114213311 has 6 divisors (see below), whose sum is σ = 159472609419240. Its totient is φ = 73602742808868.
The previous prime is 110404114213279. The next prime is 110404114213357. The reversal of 110404114213311 is 113312411404011.
110404114213311 is a `hidden beast` number, since 1 + 1 + 0 + 4 + 0 + 411 + 4 + 213 + 31 + 1 = 666.
It is not a de Polignac number, because 110404114213311 - 25 = 110404114213279 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110404114211311) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6133561900731 + ... + 6133561900748.
It is an arithmetic number, because the mean of its divisors is an integer number (26578768236540).
Almost surely, 2110404114213311 is an apocalyptic number.
110404114213311 is a deficient number, since it is larger than the sum of its proper divisors (49068495205929).
110404114213311 is a wasteful number, since it uses less digits than its factorization.
110404114213311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12267123801485 (or 12267123801482 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
Adding to 110404114213311 its reverse (113312411404011), we get a palindrome (223716525617322).
The spelling of 110404114213311 in words is "one hundred ten trillion, four hundred four billion, one hundred fourteen million, two hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •