Base | Representation |
---|---|
bin | 1100000110110111000100… |
… | …0110010100001101111111 |
3 | 1202010121121020200012100102 |
4 | 3001231301012110031333 |
5 | 3221100434242201031 |
6 | 44151240543351315 |
7 | 2542521540432224 |
oct | 301556106241577 |
9 | 52117536605312 |
10 | 13312001131391 |
11 | 42726516606a6 |
12 | 15abb562b253b |
13 | 757415c567b1 |
14 | 340438d9b94b |
15 | 18142073b7cb |
hex | c1b7119437f |
13312001131391 has 2 divisors, whose sum is σ = 13312001131392. Its totient is φ = 13312001131390.
The previous prime is 13312001131369. The next prime is 13312001131427. The reversal of 13312001131391 is 19313110021331.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13312001131391 - 210 = 13312001130367 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13312001131691) 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, 6656000565695 + 6656000565696.
It is an arithmetic number, because the mean of its divisors is an integer number (6656000565696).
Almost surely, 213312001131391 is an apocalyptic number.
13312001131391 is a deficient number, since it is larger than the sum of its proper divisors (1).
13312001131391 is an equidigital number, since it uses as much as digits as its factorization.
13312001131391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 29.
The spelling of 13312001131391 in words is "thirteen trillion, three hundred twelve billion, one million, one hundred thirty-one thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •