Base | Representation |
---|---|
bin | 111110110011011… |
… | …000011111011010 |
3 | 2201102122022202012 |
4 | 332303120133122 |
5 | 4124214011200 |
6 | 252315305522 |
7 | 35052636305 |
oct | 7663303732 |
9 | 2642568665 |
10 | 1053657050 |
11 | 4a0842156 |
12 | 254a4b2a2 |
13 | 13a3a6014 |
14 | 9dd17b3c |
15 | 6277ea35 |
hex | 3ecd87da |
1053657050 has 12 divisors (see below), whose sum is σ = 1959802206. Its totient is φ = 421462800.
The previous prime is 1053657023. The next prime is 1053657053. The reversal of 1053657050 is 507563501.
It can be written as a sum of positive squares in 3 ways, for example, as 1027779481 + 25877569 = 32059^2 + 5087^2 .
It is a super-2 number, since 2×10536570502 = 2220386358029405000, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1053656998 and 1053657016.
It is not an unprimeable number, because it can be changed into a prime (1053657053) 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 in 5 ways as a sum of consecutive naturals, for example, 10536521 + ... + 10536620.
Almost surely, 21053657050 is an apocalyptic number.
1053657050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1053657050 is a deficient number, since it is larger than the sum of its proper divisors (906145156).
1053657050 is a wasteful number, since it uses less digits than its factorization.
1053657050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21073153 (or 21073148 counting only the distinct ones).
The product of its (nonzero) digits is 15750, while the sum is 32.
The square root of 1053657050 is about 32460.0839493677. The cubic root of 1053657050 is about 1017.5749934161.
The spelling of 1053657050 in words is "one billion, fifty-three million, six hundred fifty-seven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •