Base | Representation |
---|---|
bin | 100101100100010010001011… |
… | …101110101110001010010011 |
3 | 210122222222122202110022010021 |
4 | 211210102023232232022103 |
5 | 133123440401413121001 |
6 | 1343221314032444311 |
7 | 46541556012004606 |
oct | 4544221356561223 |
9 | 718888582408107 |
10 | 165221146223251 |
11 | 4870a9928114a8 |
12 | 16644b6b6a9697 |
13 | 71263970984a1 |
14 | 2cb2a635ca33d |
15 | 1417bab6eaba1 |
hex | 96448bbae293 |
165221146223251 has 2 divisors, whose sum is σ = 165221146223252. Its totient is φ = 165221146223250.
The previous prime is 165221146223239. The next prime is 165221146223299. The reversal of 165221146223251 is 152322641122561.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 165221146223251 - 215 = 165221146190483 is a prime.
It is a super-2 number, since 2×1652211462232512 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 165221146223198 and 165221146223207.
It is not a weakly prime, because it can be changed into another prime (165221146023251) 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, 82610573111625 + 82610573111626.
It is an arithmetic number, because the mean of its divisors is an integer number (82610573111626).
Almost surely, 2165221146223251 is an apocalyptic number.
165221146223251 is a deficient number, since it is larger than the sum of its proper divisors (1).
165221146223251 is an equidigital number, since it uses as much as digits as its factorization.
165221146223251 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 345600, while the sum is 43.
The spelling of 165221146223251 in words is "one hundred sixty-five trillion, two hundred twenty-one billion, one hundred forty-six million, two hundred twenty-three thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •