Base | Representation |
---|---|
bin | 1100000110001010110100… |
… | …0011110100111011101101 |
3 | 1202002110221101101110122222 |
4 | 3001202231003310323231 |
5 | 3220402122241210104 |
6 | 44141554121045125 |
7 | 2541621266321354 |
oct | 301425503647355 |
9 | 52073841343588 |
10 | 13300122210029 |
11 | 4268606288216 |
12 | 15a97a00267a5 |
13 | 756271c05b45 |
14 | 33da2d49a99b |
15 | 180e779361be |
hex | c18ad0f4eed |
13300122210029 has 2 divisors, whose sum is σ = 13300122210030. Its totient is φ = 13300122210028.
The previous prime is 13300122209981. The next prime is 13300122210031. The reversal of 13300122210029 is 92001222100331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13300098424900 + 23785129 = 3646930^2 + 4877^2 .
It is a cyclic number.
It is not a de Polignac number, because 13300122210029 - 228 = 13299853774573 is a prime.
Together with 13300122210031, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13300122210059) 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, 6650061105014 + 6650061105015.
It is an arithmetic number, because the mean of its divisors is an integer number (6650061105015).
Almost surely, 213300122210029 is an apocalyptic number.
It is an amenable number.
13300122210029 is a deficient number, since it is larger than the sum of its proper divisors (1).
13300122210029 is an equidigital number, since it uses as much as digits as its factorization.
13300122210029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
The spelling of 13300122210029 in words is "thirteen trillion, three hundred billion, one hundred twenty-two million, two hundred ten thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.311 sec. • engine limits •