Base | Representation |
---|---|
bin | 111101001010010… |
… | …011101011100101 |
3 | 2122111210220100122 |
4 | 331022103223211 |
5 | 4100141042404 |
6 | 245453051325 |
7 | 34266544562 |
oct | 7512235345 |
9 | 2574726318 |
10 | 1026112229 |
11 | 48723933a |
12 | 247786b45 |
13 | 1347806cc |
14 | 9a3c7869 |
15 | 6013d3be |
hex | 3d293ae5 |
1026112229 has 2 divisors, whose sum is σ = 1026112230. Its totient is φ = 1026112228.
The previous prime is 1026112211. The next prime is 1026112237. The reversal of 1026112229 is 9222116201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 991620100 + 34492129 = 31490^2 + 5873^2 .
It is an emirp because it is prime and its reverse (9222116201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1026112229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1026112198 and 1026112207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1026112259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 513056114 + 513056115.
It is an arithmetic number, because the mean of its divisors is an integer number (513056115).
Almost surely, 21026112229 is an apocalyptic number.
It is an amenable number.
1026112229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1026112229 is an equidigital number, since it uses as much as digits as its factorization.
1026112229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 26.
The square root of 1026112229 is about 32032.9865763403. The cubic root of 1026112229 is about 1008.6293956636.
The spelling of 1026112229 in words is "one billion, twenty-six million, one hundred twelve thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •