Base | Representation |
---|---|
bin | 1011111011101011110100… |
… | …1000010101100011000111 |
3 | 1201110021000120200210000202 |
4 | 2332322331020111203013 |
5 | 3204424231304414343 |
6 | 43523125105401115 |
7 | 2522613624105662 |
oct | 276727510254307 |
9 | 51407016623022 |
10 | 13120003201223 |
11 | 41a9186850a56 |
12 | 157a8b263919b |
13 | 7422987238a9 |
14 | 3350239626d9 |
15 | 17b434a70db8 |
hex | beebd2158c7 |
13120003201223 has 2 divisors, whose sum is σ = 13120003201224. Its totient is φ = 13120003201222.
The previous prime is 13120003201199. The next prime is 13120003201243. The reversal of 13120003201223 is 32210230002131.
It is an a-pointer prime, because the next prime (13120003201243) can be obtained adding 13120003201223 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13120003201223 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13120003201195 and 13120003201204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13120003201243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6560001600611 + 6560001600612.
It is an arithmetic number, because the mean of its divisors is an integer number (6560001600612).
Almost surely, 213120003201223 is an apocalyptic number.
13120003201223 is a deficient number, since it is larger than the sum of its proper divisors (1).
13120003201223 is an equidigital number, since it uses as much as digits as its factorization.
13120003201223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 13120003201223 its reverse (32210230002131), we get a palindrome (45330233203354).
The spelling of 13120003201223 in words is "thirteen trillion, one hundred twenty billion, three million, two hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •