Base | Representation |
---|---|
bin | 100101010101000… |
… | …0011111110100111 |
3 | 10020021212122022111 |
4 | 1022222003332213 |
5 | 10031122242302 |
6 | 324142141451 |
7 | 43016263033 |
oct | 11252037647 |
9 | 3207778274 |
10 | 1252540327 |
11 | 5930320a5 |
12 | 2ab581887 |
13 | 16c65bc2c |
14 | bc4c91c3 |
15 | 74e680d7 |
hex | 4aa83fa7 |
1252540327 has 2 divisors, whose sum is σ = 1252540328. Its totient is φ = 1252540326.
The previous prime is 1252540321. The next prime is 1252540357. The reversal of 1252540327 is 7230452521.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1252540327 - 27 = 1252540199 is a prime.
It is a super-2 number, since 2×12525403272 = 3137714541522533858, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1252540321) 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, 626270163 + 626270164.
It is an arithmetic number, because the mean of its divisors is an integer number (626270164).
Almost surely, 21252540327 is an apocalyptic number.
1252540327 is a deficient number, since it is larger than the sum of its proper divisors (1).
1252540327 is an equidigital number, since it uses as much as digits as its factorization.
1252540327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16800, while the sum is 31.
The square root of 1252540327 is about 35391.2464742343. The cubic root of 1252540327 is about 1077.9465803882.
Adding to 1252540327 its reverse (7230452521), we get a palindrome (8482992848).
It can be divided in two parts, 125 and 2540327, that added together give a palindrome (2540452).
The spelling of 1252540327 in words is "one billion, two hundred fifty-two million, five hundred forty thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •