Base | Representation |
---|---|
bin | 100101100011001011111000… |
… | …011111011000010000110101 |
3 | 210122201202211002122101110102 |
4 | 211203023320133120100311 |
5 | 133121221303321202423 |
6 | 1343122511453203445 |
7 | 46533244305336464 |
oct | 4543137037302065 |
9 | 718652732571412 |
10 | 165145661506613 |
11 | 48690977644667 |
12 | 16632403a90585 |
13 | 711c22755b798 |
14 | 2cad1423b89db |
15 | 1415c3e838c28 |
hex | 9632f87d8435 |
165145661506613 has 2 divisors, whose sum is σ = 165145661506614. Its totient is φ = 165145661506612.
The previous prime is 165145661506591. The next prime is 165145661506663. The reversal of 165145661506613 is 316605166541561.
165145661506613 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92246458668004 + 72899202838609 = 9604502^2 + 8538103^2 .
It is a cyclic number.
It is not a de Polignac number, because 165145661506613 - 216 = 165145661441077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (165145661506663) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82572830753306 + 82572830753307.
It is an arithmetic number, because the mean of its divisors is an integer number (82572830753307).
Almost surely, 2165145661506613 is an apocalyptic number.
It is an amenable number.
165145661506613 is a deficient number, since it is larger than the sum of its proper divisors (1).
165145661506613 is an equidigital number, since it uses as much as digits as its factorization.
165145661506613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664000, while the sum is 56.
The spelling of 165145661506613 in words is "one hundred sixty-five trillion, one hundred forty-five billion, six hundred sixty-one million, five hundred six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •