Base | Representation |
---|---|
bin | 111110101101001… |
… | …100000000000011 |
3 | 2201022120211000012 |
4 | 332231030000003 |
5 | 4123310024102 |
6 | 252220415135 |
7 | 35033063453 |
oct | 7655140003 |
9 | 2638524005 |
10 | 1052033027 |
11 | 49a932a91 |
12 | 2543a74ab |
13 | 139c57a66 |
14 | 9da13d63 |
15 | 6255d752 |
hex | 3eb4c003 |
1052033027 has 2 divisors, whose sum is σ = 1052033028. Its totient is φ = 1052033026.
The previous prime is 1052033009. The next prime is 1052033053. The reversal of 1052033027 is 7203302501.
It is a weak prime.
It is an emirp because it is prime and its reverse (7203302501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1052033027 - 26 = 1052032963 is a prime.
It is a super-2 number, since 2×10520330272 = 2213546979797565458, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1052032993 and 1052033011.
It is not a weakly prime, because it can be changed into another prime (1052033077) 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, 526016513 + 526016514.
It is an arithmetic number, because the mean of its divisors is an integer number (526016514).
Almost surely, 21052033027 is an apocalyptic number.
1052033027 is a deficient number, since it is larger than the sum of its proper divisors (1).
1052033027 is an equidigital number, since it uses as much as digits as its factorization.
1052033027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 23.
The square root of 1052033027 is about 32435.0586094738. The cubic root of 1052033027 is about 1017.0519215857.
Adding to 1052033027 its reverse (7203302501), we get a palindrome (8255335528).
The spelling of 1052033027 in words is "one billion, fifty-two million, thirty-three thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •