Base | Representation |
---|---|
bin | 1001111000000010010… |
… | …1001011110101101101 |
3 | 121012220222000120012121 |
4 | 2132000211023311231 |
5 | 10234431201043023 |
6 | 205535143032541 |
7 | 15154233221503 |
oct | 2360045136555 |
9 | 535828016177 |
10 | 169660956013 |
11 | 65a5320642a |
12 | 28a6b13b751 |
13 | 12cca938943 |
14 | 82d6a1c673 |
15 | 462ebc7d5d |
hex | 278094bd6d |
169660956013 has 2 divisors, whose sum is σ = 169660956014. Its totient is φ = 169660956012.
The previous prime is 169660956011. The next prime is 169660956109. The reversal of 169660956013 is 310659066961.
169660956013 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., 161408687049 + 8252268964 = 401757^2 + 90842^2 .
It is a cyclic number.
It is not a de Polignac number, because 169660956013 - 21 = 169660956011 is a prime.
Together with 169660956011, 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 (169660956011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 84830478006 + 84830478007.
It is an arithmetic number, because the mean of its divisors is an integer number (84830478007).
Almost surely, 2169660956013 is an apocalyptic number.
It is an amenable number.
169660956013 is a deficient number, since it is larger than the sum of its proper divisors (1).
169660956013 is an equidigital number, since it uses as much as digits as its factorization.
169660956013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1574640, while the sum is 52.
The spelling of 169660956013 in words is "one hundred sixty-nine billion, six hundred sixty million, nine hundred fifty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •