Base | Representation |
---|---|
bin | 100101100100010111001000… |
… | …100011010101010100110001 |
3 | 210200000111101012022012101111 |
4 | 211210113020203111110301 |
5 | 133124032243133143114 |
6 | 1343223553312033321 |
7 | 46542134514050005 |
oct | 4544271043252461 |
9 | 720014335265344 |
10 | 165226461615409 |
11 | 48712170156287 |
12 | 16645bb3832841 |
13 | 7126a33383b4c |
14 | 2cb300950a705 |
15 | 1417dbd1a1bc4 |
hex | 9645c88d5531 |
165226461615409 has 2 divisors, whose sum is σ = 165226461615410. Its totient is φ = 165226461615408.
The previous prime is 165226461615407. The next prime is 165226461615491. The reversal of 165226461615409 is 904516164622561.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 159401735193600 + 5824726421809 = 12625440^2 + 2413447^2 .
It is an emirp because it is prime and its reverse (904516164622561) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 165226461615409 - 21 = 165226461615407 is a prime.
Together with 165226461615407, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (165226461615407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82613230807704 + 82613230807705.
It is an arithmetic number, because the mean of its divisors is an integer number (82613230807705).
Almost surely, 2165226461615409 is an apocalyptic number.
It is an amenable number.
165226461615409 is a deficient number, since it is larger than the sum of its proper divisors (1).
165226461615409 is an equidigital number, since it uses as much as digits as its factorization.
165226461615409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18662400, while the sum is 58.
The spelling of 165226461615409 in words is "one hundred sixty-five trillion, two hundred twenty-six billion, four hundred sixty-one million, six hundred fifteen thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.205 sec. • engine limits •