Base | Representation |
---|---|
bin | 1100000110110111100000… |
… | …1100010011110110000111 |
3 | 1202010121220112121121220122 |
4 | 3001231320030103312013 |
5 | 3221101210224040424 |
6 | 44151300434252155 |
7 | 2542524514136441 |
oct | 301557014236607 |
9 | 52117815547818 |
10 | 13312120143239 |
11 | 4272702857aa5 |
12 | 15abb8a12705b |
13 | 7574347c59c8 |
14 | 34044aadb491 |
15 | 18142ade945e |
hex | c1b78313d87 |
13312120143239 has 2 divisors, whose sum is σ = 13312120143240. Its totient is φ = 13312120143238.
The previous prime is 13312120143229. The next prime is 13312120143269. The reversal of 13312120143239 is 93234102121331.
13312120143239 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13312120143239 - 28 = 13312120142983 is a prime.
It is a super-2 number, since 2×133121201432392 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13312120143199 and 13312120143208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13312120143229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6656060071619 + 6656060071620.
It is an arithmetic number, because the mean of its divisors is an integer number (6656060071620).
Almost surely, 213312120143239 is an apocalyptic number.
13312120143239 is a deficient number, since it is larger than the sum of its proper divisors (1).
13312120143239 is an equidigital number, since it uses as much as digits as its factorization.
13312120143239 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23328, while the sum is 35.
The spelling of 13312120143239 in words is "thirteen trillion, three hundred twelve billion, one hundred twenty million, one hundred forty-three thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •