Base | Representation |
---|---|
bin | 1011111100010101111010… |
… | …0110011000000000101111 |
3 | 1201111100012000122102220202 |
4 | 2333011132212120000233 |
5 | 3210120401322020444 |
6 | 43532234213104115 |
7 | 2523463623400166 |
oct | 277053646300057 |
9 | 51440160572822 |
10 | 13131302141999 |
11 | 4202a547aa438 |
12 | 1580b2662803b |
13 | 743379567b72 |
14 | 3357b640c3dd |
15 | 17b8969b034e |
hex | bf15e99802f |
13131302141999 has 2 divisors, whose sum is σ = 13131302142000. Its totient is φ = 13131302141998.
The previous prime is 13131302141963. The next prime is 13131302142067. The reversal of 13131302141999 is 99914120313131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13131302141999 - 220 = 13131301093423 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13131302141899) 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, 6565651070999 + 6565651071000.
It is an arithmetic number, because the mean of its divisors is an integer number (6565651071000).
Almost surely, 213131302141999 is an apocalyptic number.
13131302141999 is a deficient number, since it is larger than the sum of its proper divisors (1).
13131302141999 is an equidigital number, since it uses as much as digits as its factorization.
13131302141999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 157464, while the sum is 47.
The spelling of 13131302141999 in words is "thirteen trillion, one hundred thirty-one billion, three hundred two million, one hundred forty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •