Base | Representation |
---|---|
bin | 100001111110011… |
… | …0001101100100000 |
3 | 2221110010021210000 |
4 | 1003330301230200 |
5 | 4313320140124 |
6 | 305042140000 |
7 | 40151613450 |
oct | 10374615440 |
9 | 2843107700 |
10 | 1140005664 |
11 | 53555a146 |
12 | 279951600 |
13 | 152249c85 |
14 | ab593d60 |
15 | 6a1396c9 |
hex | 43f31b20 |
1140005664 has 240 divisors, whose sum is σ = 3882973248. Its totient is φ = 321366528.
The previous prime is 1140005653. The next prime is 1140005683. The reversal of 1140005664 is 4665000411.
It is a super-4 number, since 4×11400056644 (a number of 37 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1505574 + ... + 1506330.
Almost surely, 21140005664 is an apocalyptic number.
1140005664 is a gapful number since it is divisible by the number (14) 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 1140005664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1941486624).
1140005664 is an abundant number, since it is smaller than the sum of its proper divisors (2742967584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1140005664 is an equidigital number, since it uses as much as digits as its factorization.
1140005664 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 869 (or 852 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The square root of 1140005664 is about 33763.9699087652. The cubic root of 1140005664 is about 1044.6456568964.
The spelling of 1140005664 in words is "one billion, one hundred forty million, five thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •