Base | Representation |
---|---|
bin | 111110110010101… |
… | …111110100011001 |
3 | 2201102022212020002 |
4 | 332302233310121 |
5 | 4124143143312 |
6 | 252311542345 |
7 | 35051343515 |
oct | 7662576431 |
9 | 2642285202 |
10 | 1053490457 |
11 | 4a0738a78 |
12 | 25498a9b5 |
13 | 13a348246 |
14 | 9dcb3145 |
15 | 6274a4c2 |
hex | 3ecafd19 |
1053490457 has 2 divisors, whose sum is σ = 1053490458. Its totient is φ = 1053490456.
The previous prime is 1053490447. The next prime is 1053490463. The reversal of 1053490457 is 7540943501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1044840976 + 8649481 = 32324^2 + 2941^2 .
It is a cyclic number.
It is not a de Polignac number, because 1053490457 - 24 = 1053490441 is a prime.
It is a super-2 number, since 2×10534904572 = 2219684285980137698, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1053490457.
It is not a weakly prime, because it can be changed into another prime (1053490447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526745228 + 526745229.
It is an arithmetic number, because the mean of its divisors is an integer number (526745229).
Almost surely, 21053490457 is an apocalyptic number.
It is an amenable number.
1053490457 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053490457 is an equidigital number, since it uses as much as digits as its factorization.
1053490457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75600, while the sum is 38.
The square root of 1053490457 is about 32457.5177270228. The cubic root of 1053490457 is about 1017.5213612259.
The spelling of 1053490457 in words is "one billion, fifty-three million, four hundred ninety thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •