Base | Representation |
---|---|
bin | 100001100011011… |
… | …1000001100000000 |
3 | 2220110112110011220 |
4 | 1003012320030000 |
5 | 4301211021410 |
6 | 303415235040 |
7 | 36620535501 |
oct | 10306701400 |
9 | 2813473156 |
10 | 1125876480 |
11 | 528589733 |
12 | 275078a80 |
13 | 14c340b01 |
14 | a9756ba8 |
15 | 68c98070 |
hex | 431b8300 |
1125876480 has 144 divisors (see below), whose sum is σ = 3609295200. Its totient is φ = 299106304.
The previous prime is 1125876461. The next prime is 1125876481. The reversal of 1125876480 is 846785211.
It is not an unprimeable number, because it can be changed into a prime (1125876481) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1723834 + ... + 1724486.
It is an arithmetic number, because the mean of its divisors is an integer number (25064550).
Almost surely, 21125876480 is an apocalyptic number.
1125876480 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 1125876480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1804647600).
1125876480 is an abundant number, since it is smaller than the sum of its proper divisors (2483418720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1125876480 is an equidigital number, since it uses as much as digits as its factorization.
1125876480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1126 (or 1112 counting only the distinct ones).
The product of its (nonzero) digits is 107520, while the sum is 42.
The square root of 1125876480 is about 33554.0829110259. The cubic root of 1125876480 is about 1040.3119379860.
The spelling of 1125876480 in words is "one billion, one hundred twenty-five million, eight hundred seventy-six thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •