Base | Representation |
---|---|
bin | 1010001000100101101010… |
… | …0110100101110011110111 |
3 | 1110110020011111110100111100 |
4 | 2202021122212211303313 |
5 | 2430030134244402412 |
6 | 35410511510341143 |
7 | 2230013426510220 |
oct | 242113246456367 |
9 | 43406144410440 |
10 | 11142665231607 |
11 | 360663a041aa8 |
12 | 12bb63405a7b3 |
13 | 62a997218270 |
14 | 2a7444b46247 |
15 | 144ca6393edc |
hex | a225a9a5cf7 |
11142665231607 has 24 divisors (see below), whose sum is σ = 19809182635424. Its totient is φ = 5877449792064.
The previous prime is 11142665231563. The next prime is 11142665231651. The reversal of 11142665231607 is 70613256624111.
It is a happy number.
11142665231607 is a `hidden beast` number, since 1 + 1 + 1 + 4 + 2 + 6 + 6 + 5 + 2 + 31 + 607 = 666.
It is an interprime number because it is at equal distance from previous prime (11142665231563) and next prime (11142665231651).
It is not a de Polignac number, because 11142665231607 - 28 = 11142665231351 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11142665231407) 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 23 ways as a sum of consecutive naturals, for example, 6802603108 + ... + 6802604745.
Almost surely, 211142665231607 is an apocalyptic number.
11142665231607 is a deficient number, since it is larger than the sum of its proper divisors (8666517403817).
11142665231607 is a wasteful number, since it uses less digits than its factorization.
11142665231607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13605207879 (or 13605207876 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The spelling of 11142665231607 in words is "eleven trillion, one hundred forty-two billion, six hundred sixty-five million, two hundred thirty-one thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •