Base | Representation |
---|---|
bin | 110011110010011000… |
… | …1010101010100001101 |
3 | 101122001120121012210022 |
4 | 1213210301111110031 |
5 | 3310230323220023 |
6 | 123031253551525 |
7 | 11014642060064 |
oct | 1474461252415 |
9 | 348046535708 |
10 | 111212320013 |
11 | 4318a501083 |
12 | 196789455a5 |
13 | a644715c22 |
14 | 55501dd1db |
15 | 2d5d7687c8 |
hex | 19e4c5550d |
111212320013 has 2 divisors, whose sum is σ = 111212320014. Its totient is φ = 111212320012.
The previous prime is 111212319947. The next prime is 111212320103. The reversal of 111212320013 is 310023212111.
Together with next prime (111212320103) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108766720804 + 2445599209 = 329798^2 + 49453^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111212320013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111212319973 and 111212320000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111212325013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55606160006 + 55606160007.
It is an arithmetic number, because the mean of its divisors is an integer number (55606160007).
Almost surely, 2111212320013 is an apocalyptic number.
It is an amenable number.
111212320013 is a deficient number, since it is larger than the sum of its proper divisors (1).
111212320013 is an equidigital number, since it uses as much as digits as its factorization.
111212320013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 111212320013 its reverse (310023212111), we get a palindrome (421235532124).
The spelling of 111212320013 in words is "one hundred eleven billion, two hundred twelve million, three hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •