Base | Representation |
---|---|
bin | 111100010010010… |
… | …011001101010101 |
3 | 2121111011222102212 |
4 | 330102103031111 |
5 | 4032411231404 |
6 | 244210243205 |
7 | 34031005115 |
oct | 7422231525 |
9 | 2544158385 |
10 | 1011430229 |
11 | 479a20557 |
12 | 242886505 |
13 | 13170ca34 |
14 | 98485045 |
15 | 5dbdd06e |
hex | 3c493355 |
1011430229 has 2 divisors, whose sum is σ = 1011430230. Its totient is φ = 1011430228.
The previous prime is 1011430201. The next prime is 1011430237. The reversal of 1011430229 is 9220341101.
1011430229 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 918211204 + 93219025 = 30302^2 + 9655^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011430229 - 28 = 1011429973 is a prime.
It is a super-2 number, since 2×10114302292 = 2045982216269984882, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011430279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505715114 + 505715115.
It is an arithmetic number, because the mean of its divisors is an integer number (505715115).
Almost surely, 21011430229 is an apocalyptic number.
It is an amenable number.
1011430229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011430229 is an equidigital number, since it uses as much as digits as its factorization.
1011430229 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 23.
The square root of 1011430229 is about 31802.9908813621. The cubic root of 1011430229 is about 1003.7956511378.
The spelling of 1011430229 in words is "one billion, eleven million, four hundred thirty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •