Base | Representation |
---|---|
bin | 1001100111110110001… |
… | …1001111011011001101 |
3 | 120210201002121121121121 |
4 | 2121331203033123031 |
5 | 10202031134204334 |
6 | 203540021200541 |
7 | 14641443365653 |
oct | 2317543173315 |
9 | 523632547547 |
10 | 165315147469 |
11 | 6412310011a |
12 | 28057860151 |
13 | 1278749aab4 |
14 | 80037acdd3 |
15 | 44783e5db4 |
hex | 267d8cf6cd |
165315147469 has 2 divisors, whose sum is σ = 165315147470. Its totient is φ = 165315147468.
The previous prime is 165315147467. The next prime is 165315147589. The reversal of 165315147469 is 964741513561.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 161885522500 + 3429624969 = 402350^2 + 58563^2 .
It is a cyclic number.
It is not a de Polignac number, because 165315147469 - 21 = 165315147467 is a prime.
It is a super-2 number, since 2×1653151474692 (a number of 23 digits) contains 22 as substring.
Together with 165315147467, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (165315147467) 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 as a sum of consecutive naturals, namely, 82657573734 + 82657573735.
It is an arithmetic number, because the mean of its divisors is an integer number (82657573735).
Almost surely, 2165315147469 is an apocalyptic number.
It is an amenable number.
165315147469 is a deficient number, since it is larger than the sum of its proper divisors (1).
165315147469 is an equidigital number, since it uses as much as digits as its factorization.
165315147469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2721600, while the sum is 52.
The spelling of 165315147469 in words is "one hundred sixty-five billion, three hundred fifteen million, one hundred forty-seven thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •