Base | Representation |
---|---|
bin | 111110101111101… |
… | …100101000111000 |
3 | 2201100211020120120 |
4 | 332233230220320 |
5 | 4123442103000 |
6 | 252242453240 |
7 | 35041503654 |
oct | 7657545070 |
9 | 2640736516 |
10 | 1052691000 |
11 | 4a0242369 |
12 | 254664220 |
13 | 13a1283aa |
14 | 9db45a64 |
15 | 6263d6a0 |
hex | 3ebeca38 |
1052691000 has 128 divisors (see below), whose sum is σ = 3477764160. Its totient is φ = 264192000.
The previous prime is 1052690941. The next prime is 1052691011. The reversal of 1052691000 is 1962501.
It is a super-2 number, since 2×10526910002 = 2216316682962000000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
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, 40680 + ... + 61320.
Almost surely, 21052691000 is an apocalyptic number.
1052691000 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 1052691000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1738882080).
1052691000 is an abundant number, since it is smaller than the sum of its proper divisors (2425073160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1052691000 is a wasteful number, since it uses less digits than its factorization.
1052691000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20682 (or 20668 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 24.
The square root of 1052691000 is about 32445.1999531518. The cubic root of 1052691000 is about 1017.2639089867.
The spelling of 1052691000 in words is "one billion, fifty-two million, six hundred ninety-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •