Base | Representation |
---|---|
bin | 1011111100010101111010… |
… | …0110101011010101001001 |
3 | 1201111100012000210110110111 |
4 | 2333011132212223111021 |
5 | 3210120401332034004 |
6 | 43532234214514321 |
7 | 2523463624146661 |
oct | 277053646532511 |
9 | 51440160713414 |
10 | 13131302221129 |
11 | 4202a54853934 |
12 | 1580b266659a1 |
13 | 743379594ba1 |
14 | 3357b642d1a1 |
15 | 17b8969c8a04 |
hex | bf15e9ab549 |
13131302221129 has 2 divisors, whose sum is σ = 13131302221130. Its totient is φ = 13131302221128.
The previous prime is 13131302221117. The next prime is 13131302221133. The reversal of 13131302221129 is 92112220313131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11110568895504 + 2020733325625 = 3333252^2 + 1421525^2 .
It is an emirp because it is prime and its reverse (92112220313131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13131302221129 - 27 = 13131302221001 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13131302221129.
It is not a weakly prime, because it can be changed into another prime (13131302221159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565651110564 + 6565651110565.
It is an arithmetic number, because the mean of its divisors is an integer number (6565651110565).
Almost surely, 213131302221129 is an apocalyptic number.
It is an amenable number.
13131302221129 is a deficient number, since it is larger than the sum of its proper divisors (1).
13131302221129 is an equidigital number, since it uses as much as digits as its factorization.
13131302221129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 31.
The spelling of 13131302221129 in words is "thirteen trillion, one hundred thirty-one billion, three hundred two million, two hundred twenty-one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •