Base | Representation |
---|---|
bin | 1011111110011001011010… |
… | …1101000100111011110011 |
3 | 1201121201022012202000202012 |
4 | 2333212112231010323303 |
5 | 3211210200402130311 |
6 | 44000353132313135 |
7 | 2526153462166664 |
oct | 277462655047363 |
9 | 51551265660665 |
10 | 13166603161331 |
11 | 4216a1a260784 |
12 | 15879389127ab |
13 | 7467b3c55599 |
14 | 3373a48b536b |
15 | 17c760ba178b |
hex | bf996b44ef3 |
13166603161331 has 2 divisors, whose sum is σ = 13166603161332. Its totient is φ = 13166603161330.
The previous prime is 13166603161303. The next prime is 13166603161381. The reversal of 13166603161331 is 13316130666131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13166603161331 - 26 = 13166603161267 is a prime.
It is a super-2 number, since 2×131666031613312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13166603161381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6583301580665 + 6583301580666.
It is an arithmetic number, because the mean of its divisors is an integer number (6583301580666).
Almost surely, 213166603161331 is an apocalyptic number.
13166603161331 is a deficient number, since it is larger than the sum of its proper divisors (1).
13166603161331 is an equidigital number, since it uses as much as digits as its factorization.
13166603161331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 104976, while the sum is 41.
The spelling of 13166603161331 in words is "thirteen trillion, one hundred sixty-six billion, six hundred three million, one hundred sixty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •