Base | Representation |
---|---|
bin | 100001001111000… |
… | …1100101010000101 |
3 | 2212201110122211202 |
4 | 1002132030222011 |
5 | 4240443244141 |
6 | 302354512245 |
7 | 36431102111 |
oct | 10236145205 |
9 | 2781418752 |
10 | 1115212421 |
11 | 522565664 |
12 | 271595685 |
13 | 14a078c0b |
14 | a817c741 |
15 | 67d8d49b |
hex | 4278ca85 |
1115212421 has 2 divisors, whose sum is σ = 1115212422. Its totient is φ = 1115212420.
The previous prime is 1115212349. The next prime is 1115212433. The reversal of 1115212421 is 1242125111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 811965025 + 303247396 = 28495^2 + 17414^2 .
It is a cyclic number.
It is not a de Polignac number, because 1115212421 - 226 = 1048103557 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1115212393 and 1115212402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1115212451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 557606210 + 557606211.
It is an arithmetic number, because the mean of its divisors is an integer number (557606211).
Almost surely, 21115212421 is an apocalyptic number.
It is an amenable number.
1115212421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1115212421 is an equidigital number, since it uses as much as digits as its factorization.
1115212421 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 160, while the sum is 20.
The square root of 1115212421 is about 33394.7963161927. The cubic root of 1115212421 is about 1037.0169762204.
Adding to 1115212421 its reverse (1242125111), we get a palindrome (2357337532).
The spelling of 1115212421 in words is "one billion, one hundred fifteen million, two hundred twelve thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •