Base | Representation |
---|---|
bin | 100001100010111… |
… | …1110011101000000 |
3 | 2220110002102210101 |
4 | 1003011332131000 |
5 | 4301130440000 |
6 | 303410212144 |
7 | 36615532162 |
oct | 10305763500 |
9 | 2813072711 |
10 | 1125640000 |
11 | 528437aa1 |
12 | 274b84054 |
13 | 14c28a294 |
14 | a96d4932 |
15 | 68c4ce6a |
hex | 4317e740 |
1125640000 has 140 divisors (see below), whose sum is σ = 2828019744. Its totient is φ = 444352000.
The previous prime is 1125639997. The next prime is 1125640001. The reversal of 1125640000 is 465211.
It is a self number, because there is not a number n which added to its sum of digits gives 1125640000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1125640001) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4279869 + ... + 4280131.
Almost surely, 21125640000 is an apocalyptic number.
1125640000 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 1125640000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1414009872).
1125640000 is an abundant number, since it is smaller than the sum of its proper divisors (1702379744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1125640000 is an equidigital number, since it uses as much as digits as its factorization.
1125640000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 402 (or 377 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 1125640000 is about 33550.5588627075. The cubic root of 1125640000 is about 1040.2390969010.
The spelling of 1125640000 in words is "one billion, one hundred twenty-five million, six hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •