Base | Representation |
---|---|
bin | 11001000110101101011110… |
… | …100101110000001110000101 |
3 | 112110221022110210212121102210 |
4 | 121012231132211300032011 |
5 | 103432443403133432123 |
6 | 1030454414320254033 |
7 | 32154012000261420 |
oct | 3106553645601605 |
9 | 473838423777383 |
10 | 110412311233413 |
11 | 321a9664280462 |
12 | 1047278b771319 |
13 | 497bab43a61a7 |
14 | 1d39dad1ba9b7 |
15 | cb7126d58e93 |
hex | 646b5e970385 |
110412311233413 has 16 divisors (see below), whose sum is σ = 169981839977600. Its totient is φ = 62442308560896.
The previous prime is 110412311233381. The next prime is 110412311233447. The reversal of 110412311233413 is 314332113214011.
It is a happy number.
It is not a de Polignac number, because 110412311233413 - 25 = 110412311233381 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110412311223413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27101694388 + ... + 27101698461.
It is an arithmetic number, because the mean of its divisors is an integer number (10623864998600).
Almost surely, 2110412311233413 is an apocalyptic number.
It is an amenable number.
110412311233413 is a deficient number, since it is larger than the sum of its proper divisors (59569528744187).
110412311233413 is an equidigital number, since it uses as much as digits as its factorization.
110412311233413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54203392956.
The product of its (nonzero) digits is 5184, while the sum is 30.
Adding to 110412311233413 its reverse (314332113214011), we get a palindrome (424744424447424).
The spelling of 110412311233413 in words is "one hundred ten trillion, four hundred twelve billion, three hundred eleven million, two hundred thirty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •