Base | Representation |
---|---|
bin | 111100010001111… |
… | …111101000001011 |
3 | 2121111000220102102 |
4 | 330101333220023 |
5 | 4032401200102 |
6 | 244204424015 |
7 | 34030222232 |
oct | 7421775013 |
9 | 2544026372 |
10 | 1011350027 |
11 | 479976276 |
12 | 24284800b |
13 | 1316b238c |
14 | 98463b19 |
15 | 5dbc4402 |
hex | 3c47fa0b |
1011350027 has 2 divisors, whose sum is σ = 1011350028. Its totient is φ = 1011350026.
The previous prime is 1011350023. The next prime is 1011350051. The reversal of 1011350027 is 7200531101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1011350027 - 22 = 1011350023 is a prime.
It is a super-2 number, since 2×10113500272 = 2045657754225801458, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1011349990 and 1011350008.
It is not a weakly prime, because it can be changed into another prime (1011350023) 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, 505675013 + 505675014.
It is an arithmetic number, because the mean of its divisors is an integer number (505675014).
Almost surely, 21011350027 is an apocalyptic number.
1011350027 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011350027 is an equidigital number, since it uses as much as digits as its factorization.
1011350027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 210, while the sum is 20.
The square root of 1011350027 is about 31801.7299372220. The cubic root of 1011350027 is about 1003.7691182327.
Adding to 1011350027 its reverse (7200531101), we get a palindrome (8211881128).
The spelling of 1011350027 in words is "one billion, eleven million, three hundred fifty thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •