Base | Representation |
---|---|
bin | 1011111110011010110000… |
… | …1001100000001100101001 |
3 | 1201121202020021201101211221 |
4 | 2333212230021200030221 |
5 | 3211211420002401234 |
6 | 44000452543422041 |
7 | 2526165421210363 |
oct | 277465411401451 |
9 | 51552207641757 |
10 | 13166962934569 |
11 | 4217094350734 |
12 | 1587a192b4921 |
13 | 746840651062 |
14 | 3373da5a7d33 |
15 | 17c78256aeb4 |
hex | bf9ac260329 |
13166962934569 has 2 divisors, whose sum is σ = 13166962934570. Its totient is φ = 13166962934568.
The previous prime is 13166962934561. The next prime is 13166962934579. The reversal of 13166962934569 is 96543926966131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8249745384169 + 4917217550400 = 2872237^2 + 2217480^2 .
It is a cyclic number.
It is not a de Polignac number, because 13166962934569 - 23 = 13166962934561 is a prime.
It is a super-2 number, since 2×131669629345692 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13166962934498 and 13166962934507.
It is not a weakly prime, because it can be changed into another prime (13166962934561) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6583481467284 + 6583481467285.
It is an arithmetic number, because the mean of its divisors is an integer number (6583481467285).
Almost surely, 213166962934569 is an apocalyptic number.
It is an amenable number.
13166962934569 is a deficient number, since it is larger than the sum of its proper divisors (1).
13166962934569 is an equidigital number, since it uses as much as digits as its factorization.
13166962934569 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 340122240, while the sum is 70.
The spelling of 13166962934569 in words is "thirteen trillion, one hundred sixty-six billion, nine hundred sixty-two million, nine hundred thirty-four thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •