Base | Representation |
---|---|
bin | 1100000110001010110100… |
… | …0011011010010100100011 |
3 | 1202002110221101011221010212 |
4 | 3001202231003122110203 |
5 | 3220402122224213102 |
6 | 44141554114444335 |
7 | 2541621265355516 |
oct | 301425503322443 |
9 | 52073841157125 |
10 | 13300122101027 |
11 | 4268606213333 |
12 | 15a979bb936ab |
13 | 756271b98348 |
14 | 33da2d46cd7d |
15 | 180e77913c52 |
hex | c18ad0da523 |
13300122101027 has 2 divisors, whose sum is σ = 13300122101028. Its totient is φ = 13300122101026.
The previous prime is 13300122100981. The next prime is 13300122101029. The reversal of 13300122101027 is 72010122100331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13300122101027 - 212 = 13300122096931 is a prime.
Together with 13300122101029, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 13300122100993 and 13300122101011.
It is not a weakly prime, because it can be changed into another prime (13300122101029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650061050513 + 6650061050514.
It is an arithmetic number, because the mean of its divisors is an integer number (6650061050514).
Almost surely, 213300122101027 is an apocalyptic number.
13300122101027 is a deficient number, since it is larger than the sum of its proper divisors (1).
13300122101027 is an equidigital number, since it uses as much as digits as its factorization.
13300122101027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 13300122101027 its reverse (72010122100331), we get a palindrome (85310244201358).
The spelling of 13300122101027 in words is "thirteen trillion, three hundred billion, one hundred twenty-two million, one hundred one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •