Base | Representation |
---|---|
bin | 1001101000001101100… |
… | …0100111000101101111 |
3 | 120210221220210021010102 |
4 | 2122003120213011233 |
5 | 10202231213232421 |
6 | 203553435101315 |
7 | 14644042335416 |
oct | 2320330470557 |
9 | 523856707112 |
10 | 165413024111 |
11 | 64173381305 |
12 | 280845a183b |
13 | 127a1849c7a |
14 | 80127aa47d |
15 | 4481ccb60b |
hex | 268362716f |
165413024111 has 2 divisors, whose sum is σ = 165413024112. Its totient is φ = 165413024110.
The previous prime is 165413024071. The next prime is 165413024143. The reversal of 165413024111 is 111420314561.
165413024111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 165413024111 - 218 = 165412761967 is a prime.
It is a super-2 number, since 2×1654130241112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (165413024411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82706512055 + 82706512056.
It is an arithmetic number, because the mean of its divisors is an integer number (82706512056).
Almost surely, 2165413024111 is an apocalyptic number.
165413024111 is a deficient number, since it is larger than the sum of its proper divisors (1).
165413024111 is an equidigital number, since it uses as much as digits as its factorization.
165413024111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 29.
Adding to 165413024111 its reverse (111420314561), we get a palindrome (276833338672).
The spelling of 165413024111 in words is "one hundred sixty-five billion, four hundred thirteen million, twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •