Base | Representation |
---|---|
bin | 1011110110000011100100… |
… | …1011101100110101010111 |
3 | 1201010000102011221211120111 |
4 | 2331200321023230311113 |
5 | 3201333204323210012 |
6 | 43410453240543451 |
7 | 2512621343203663 |
oct | 275407113546527 |
9 | 51100364854514 |
10 | 13023300210007 |
11 | 41711724a73aa |
12 | 1564004a81b87 |
13 | 736126cb9b29 |
14 | 33048c73d8a3 |
15 | 178b74ee7ba7 |
hex | bd8392ecd57 |
13023300210007 has 2 divisors, whose sum is σ = 13023300210008. Its totient is φ = 13023300210006.
The previous prime is 13023300209971. The next prime is 13023300210029. The reversal of 13023300210007 is 70001200332031.
It is a happy number.
It is an a-pointer prime, because the next prime (13023300210029) can be obtained adding 13023300210007 to its sum of digits (22).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13023300210007 - 27 = 13023300209879 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13023300210007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13023300210607) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6511650105003 + 6511650105004.
It is an arithmetic number, because the mean of its divisors is an integer number (6511650105004).
Almost surely, 213023300210007 is an apocalyptic number.
13023300210007 is a deficient number, since it is larger than the sum of its proper divisors (1).
13023300210007 is an equidigital number, since it uses as much as digits as its factorization.
13023300210007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 22.
Adding to 13023300210007 its reverse (70001200332031), we get a palindrome (83024500542038).
The spelling of 13023300210007 in words is "thirteen trillion, twenty-three billion, three hundred million, two hundred ten thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •