Base | Representation |
---|---|
bin | 111111011010111… |
… | …111011001000000 |
3 | 2202011011211110220 |
4 | 333122333121000 |
5 | 4134343240000 |
6 | 253330023040 |
7 | 35240122302 |
oct | 7732773100 |
9 | 2664154426 |
10 | 1064040000 |
11 | 4a6694001 |
12 | 258417a80 |
13 | 13c59cc8a |
14 | a145b972 |
15 | 636311a0 |
hex | 3f6bf640 |
1064040000 has 140 divisors (see below), whose sum is σ = 3518361264. Its totient is φ = 283712000.
The previous prime is 1064039987. The next prime is 1064040011. The reversal of 1064040000 is 404601.
It is a super-2 number, since 2×10640400002 = 2264362243200000000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 115567 + ... + 124433.
Almost surely, 21064040000 is an apocalyptic number.
1064040000 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 1064040000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1759180632).
1064040000 is an abundant number, since it is smaller than the sum of its proper divisors (2454321264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1064040000 is an frugal number, since it uses more digits than its factorization.
1064040000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8902 (or 8877 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 1064040000 is about 32619.6259941772. The cubic root of 1064040000 is about 1020.9065373947.
Adding to 1064040000 its reverse (404601), we get a palindrome (1064444601).
The spelling of 1064040000 in words is "one billion, sixty-four million, forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.058 sec. • engine limits •