Base | Representation |
---|---|
bin | 1100000010001010010000… |
… | …1111111001100110000001 |
3 | 1201211220011220101210200011 |
4 | 3000202210033321212001 |
5 | 3213240102223400134 |
6 | 44050204331424521 |
7 | 2533632555011152 |
oct | 300424417714601 |
9 | 51756156353604 |
10 | 13231254903169 |
11 | 4241386500286 |
12 | 15983805b5141 |
13 | 74c918347c24 |
14 | 33a579093929 |
15 | 17e2969b8264 |
hex | c08a43f9981 |
13231254903169 has 2 divisors, whose sum is σ = 13231254903170. Its totient is φ = 13231254903168.
The previous prime is 13231254903161. The next prime is 13231254903173. The reversal of 13231254903169 is 96130945213231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6673619722225 + 6557635180944 = 2583335^2 + 2560788^2 .
It is an emirp because it is prime and its reverse (96130945213231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13231254903169 - 23 = 13231254903161 is a prime.
It is a super-2 number, since 2×132312549031692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13231254903161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6615627451584 + 6615627451585.
It is an arithmetic number, because the mean of its divisors is an integer number (6615627451585).
Almost surely, 213231254903169 is an apocalyptic number.
It is an amenable number.
13231254903169 is a deficient number, since it is larger than the sum of its proper divisors (1).
13231254903169 is an equidigital number, since it uses as much as digits as its factorization.
13231254903169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1049760, while the sum is 49.
The spelling of 13231254903169 in words is "thirteen trillion, two hundred thirty-one billion, two hundred fifty-four million, nine hundred three thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •