Base | Representation |
---|---|
bin | 100101100010101110110010… |
… | …101010100100101110101001 |
3 | 210122121210012012010220111022 |
4 | 211202232302222210232221 |
5 | 133120213320331440230 |
6 | 1343100304140142225 |
7 | 46531060244560043 |
oct | 4542566252445651 |
9 | 718553165126438 |
10 | 165114425265065 |
11 | 486796a85a1001 |
12 | 16628346b37975 |
13 | 71192ba023313 |
14 | 2cab81bac8a93 |
15 | 14150124161e5 |
hex | 962bb2aa4ba9 |
165114425265065 has 16 divisors (see below), whose sum is σ = 198326627091840. Its totient is φ = 131965356038400.
The previous prime is 165114425265029. The next prime is 165114425265089. The reversal of 165114425265065 is 560562524411561.
165114425265065 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 165114425265065 - 26 = 165114425265001 is a prime.
It is a super-2 number, since 2×1651144252650652 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 165114425264998 and 165114425265016.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47359466 + ... + 50726204.
It is an arithmetic number, because the mean of its divisors is an integer number (12395414193240).
Almost surely, 2165114425265065 is an apocalyptic number.
It is an amenable number.
165114425265065 is a deficient number, since it is larger than the sum of its proper divisors (33212201826775).
165114425265065 is a wasteful number, since it uses less digits than its factorization.
165114425265065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3376112.
The product of its (nonzero) digits is 8640000, while the sum is 53.
The spelling of 165114425265065 in words is "one hundred sixty-five trillion, one hundred fourteen billion, four hundred twenty-five million, two hundred sixty-five thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •