Base | Representation |
---|---|
bin | 1100000110001011000110… |
… | …1100111101110110100011 |
3 | 1202002111010210221212012002 |
4 | 3001202301230331312203 |
5 | 3220402302211301311 |
6 | 44142005542354215 |
7 | 2541623233361501 |
oct | 301426154756643 |
9 | 52074123855162 |
10 | 13300200103331 |
11 | 426864624a649 |
12 | 15a980212b96b |
13 | 7562850a935b |
14 | 33da39975671 |
15 | 180e7e6c093b |
hex | c18b1b3dda3 |
13300200103331 has 2 divisors, whose sum is σ = 13300200103332. Its totient is φ = 13300200103330.
The previous prime is 13300200103327. The next prime is 13300200103339. The reversal of 13300200103331 is 13330100200331.
It is a weak prime.
It is an emirp because it is prime and its reverse (13330100200331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13300200103331 - 22 = 13300200103327 is a prime.
It is a super-2 number, since 2×133002001033312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13300200103339) 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, 6650100051665 + 6650100051666.
It is an arithmetic number, because the mean of its divisors is an integer number (6650100051666).
Almost surely, 213300200103331 is an apocalyptic number.
13300200103331 is a deficient number, since it is larger than the sum of its proper divisors (1).
13300200103331 is an equidigital number, since it uses as much as digits as its factorization.
13300200103331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 13300200103331 its reverse (13330100200331), we get a palindrome (26630300303662).
The spelling of 13300200103331 in words is "thirteen trillion, three hundred billion, two hundred million, one hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •