Base | Representation |
---|---|
bin | 100001111111010… |
… | …0001000111110000 |
3 | 2221110222110211201 |
4 | 1003332201013300 |
5 | 4313424241224 |
6 | 305100020544 |
7 | 40155524200 |
oct | 10376410760 |
9 | 2843873751 |
10 | 1140462064 |
11 | 535841035 |
12 | 279b31754 |
13 | 152379931 |
14 | ab672400 |
15 | 6a1c9a44 |
hex | 43fa11f0 |
1140462064 has 60 divisors (see below), whose sum is σ = 2605745424. Its totient is φ = 482049792.
The previous prime is 1140462049. The next prime is 1140462067. The reversal of 1140462064 is 4602640411.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140462067) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 47269 + ... + 67195.
Almost surely, 21140462064 is an apocalyptic number.
1140462064 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 1140462064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1302872712).
1140462064 is an abundant number, since it is smaller than the sum of its proper divisors (1465283360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1140462064 is a wasteful number, since it uses less digits than its factorization.
1140462064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20022 (or 20009 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
The square root of 1140462064 is about 33770.7279163479. The cubic root of 1140462064 is about 1044.7850458724.
The spelling of 1140462064 in words is "one billion, one hundred forty million, four hundred sixty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •