Base | Representation |
---|---|
bin | 111100010101001… |
… | …111001010101101 |
3 | 2121112122002111221 |
4 | 330111033022231 |
5 | 4033110400414 |
6 | 244234543341 |
7 | 34040362504 |
oct | 7425171255 |
9 | 2545562457 |
10 | 1012200109 |
11 | 47a3a6a18 |
12 | 242b97b51 |
13 | 13191c29b |
14 | 9860583b |
15 | 5dce1224 |
hex | 3c54f2ad |
1012200109 has 2 divisors, whose sum is σ = 1012200110. Its totient is φ = 1012200108.
The previous prime is 1012200103. The next prime is 1012200113. The reversal of 1012200109 is 9010022101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 867479209 + 144720900 = 29453^2 + 12030^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1012200109 is a prime.
It is a super-2 number, since 2×10122001092 = 2049098121319223762, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1012200092 and 1012200101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012200103) 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, 506100054 + 506100055.
It is an arithmetic number, because the mean of its divisors is an integer number (506100055).
Almost surely, 21012200109 is an apocalyptic number.
It is an amenable number.
1012200109 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012200109 is an equidigital number, since it uses as much as digits as its factorization.
1012200109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
The square root of 1012200109 is about 31815.0924719700. The cubic root of 1012200109 is about 1004.0502761155.
The spelling of 1012200109 in words is "one billion, twelve million, two hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •