Base | Representation |
---|---|
bin | 111110110000011… |
… | …111011010010000 |
3 | 2201101012210211210 |
4 | 332300133122100 |
5 | 4124020231320 |
6 | 252251140120 |
7 | 35043331161 |
oct | 7660373220 |
9 | 2641183753 |
10 | 1052898960 |
11 | 4a0374633 |
12 | 254744640 |
13 | 13a19bc49 |
14 | 9db9b768 |
15 | 626800e0 |
hex | 3ec1f690 |
1052898960 has 160 divisors (see below), whose sum is σ = 3327787008. Its totient is φ = 275351040.
The previous prime is 1052898949. The next prime is 1052899009. The reversal of 1052898960 is 698982501.
It is a happy number.
It is a super-2 number, since 2×10528989602 = 2217192439938163200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4721409 + ... + 4721631.
Almost surely, 21052898960 is an apocalyptic number.
1052898960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1052898960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1663893504).
1052898960 is an abundant number, since it is smaller than the sum of its proper divisors (2274888048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1052898960 is a wasteful number, since it uses less digits than its factorization.
1052898960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 533 (or 527 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 48.
The square root of 1052898960 is about 32448.4045832765. The cubic root of 1052898960 is about 1017.3308916921.
The spelling of 1052898960 in words is "one billion, fifty-two million, eight hundred ninety-eight thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •