Base | Representation |
---|---|
bin | 1100000110101111101110… |
… | …0111011101110101101111 |
3 | 1202010102111212211221101111 |
4 | 3001223323213131311233 |
5 | 3221032420202010223 |
6 | 44150313213452451 |
7 | 2542421645143321 |
oct | 301537347356557 |
9 | 52112455757344 |
10 | 13310030110063 |
11 | 4271830007155 |
12 | 15ab6a61a1127 |
13 | 7571907b759b |
14 | 3402cd2c7611 |
15 | 1813576a030d |
hex | c1afb9ddd6f |
13310030110063 has 2 divisors, whose sum is σ = 13310030110064. Its totient is φ = 13310030110062.
The previous prime is 13310030110019. The next prime is 13310030110081. The reversal of 13310030110063 is 36001103001331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13310030110063 - 213 = 13310030101871 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13310030140063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655015055031 + 6655015055032.
It is an arithmetic number, because the mean of its divisors is an integer number (6655015055032).
Almost surely, 213310030110063 is an apocalyptic number.
13310030110063 is a deficient number, since it is larger than the sum of its proper divisors (1).
13310030110063 is an equidigital number, since it uses as much as digits as its factorization.
13310030110063 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 22.
Adding to 13310030110063 its reverse (36001103001331), we get a palindrome (49311133111394).
The spelling of 13310030110063 in words is "thirteen trillion, three hundred ten billion, thirty million, one hundred ten thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •