Base | Representation |
---|---|
bin | 1011111110011000110101… |
… | …0011000001111000110001 |
3 | 1201121200220012202210001121 |
4 | 2333212031103001320301 |
5 | 3211204340001310121 |
6 | 44000325333502241 |
7 | 2526146534545063 |
oct | 277461523017061 |
9 | 51550805683047 |
10 | 13166445338161 |
11 | 4216949165905 |
12 | 15878b3aa1981 |
13 | 74678a3478ab |
14 | 33738b951733 |
15 | 17c751dc9141 |
hex | bf98d4c1e31 |
13166445338161 has 2 divisors, whose sum is σ = 13166445338162. Its totient is φ = 13166445338160.
The previous prime is 13166445338147. The next prime is 13166445338171. The reversal of 13166445338161 is 16183354466131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12113399945761 + 1053045392400 = 3480431^2 + 1026180^2 .
It is a cyclic number.
It is not a de Polignac number, because 13166445338161 - 25 = 13166445338129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13166445338099 and 13166445338108.
It is not a weakly prime, because it can be changed into another prime (13166445338171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6583222669080 + 6583222669081.
It is an arithmetic number, because the mean of its divisors is an integer number (6583222669081).
Almost surely, 213166445338161 is an apocalyptic number.
It is an amenable number.
13166445338161 is a deficient number, since it is larger than the sum of its proper divisors (1).
13166445338161 is an equidigital number, since it uses as much as digits as its factorization.
13166445338161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3732480, while the sum is 52.
The spelling of 13166445338161 in words is "thirteen trillion, one hundred sixty-six billion, four hundred forty-five million, three hundred thirty-eight thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •