Base | Representation |
---|---|
bin | 1100000110110011010110… |
… | …0011011100001011110111 |
3 | 1202010112000121212211111212 |
4 | 3001230311203130023313 |
5 | 3221041413021230424 |
6 | 44150553455352035 |
7 | 2542455020203166 |
oct | 301546543341367 |
9 | 52115017784455 |
10 | 13311002133239 |
11 | 4272189761598 |
12 | 15ab91782261b |
13 | 7572b6caa625 |
14 | 3403824313dd |
15 | 1813b2ba710e |
hex | c1b358dc2f7 |
13311002133239 has 2 divisors, whose sum is σ = 13311002133240. Its totient is φ = 13311002133238.
The previous prime is 13311002133223. The next prime is 13311002133271. The reversal of 13311002133239 is 93233120011331.
It is an a-pointer prime, because the next prime (13311002133271) can be obtained adding 13311002133239 to its sum of digits (32).
It is a weak prime.
It is an emirp because it is prime and its reverse (93233120011331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13311002133239 - 24 = 13311002133223 is a prime.
It is a super-2 number, since 2×133110021332392 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13311002133739) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655501066619 + 6655501066620.
It is an arithmetic number, because the mean of its divisors is an integer number (6655501066620).
Almost surely, 213311002133239 is an apocalyptic number.
13311002133239 is a deficient number, since it is larger than the sum of its proper divisors (1).
13311002133239 is an equidigital number, since it uses as much as digits as its factorization.
13311002133239 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 32.
The spelling of 13311002133239 in words is "thirteen trillion, three hundred eleven billion, two million, one hundred thirty-three thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.076 sec. • engine limits •