Base | Representation |
---|---|
bin | 100001101000010… |
… | …1101010000000000 |
3 | 2220122101100200000 |
4 | 1003100231100000 |
5 | 4302340444440 |
6 | 303550400000 |
7 | 36651456534 |
oct | 10320552000 |
9 | 2818340600 |
10 | 1128453120 |
11 | 529a89593 |
12 | 275b00000 |
13 | 14ca33852 |
14 | a9c27bc4 |
15 | 69106730 |
hex | 4342d400 |
1128453120 has 264 divisors, whose sum is σ = 4059348384. Its totient is φ = 300589056.
The previous prime is 1128453107. The next prime is 1128453169. The reversal of 1128453120 is 213548211.
1128453120 is a `hidden beast` number, since 1 + 128 + 4 + 531 + 2 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1243707 + ... + 1244613.
Almost surely, 21128453120 is an apocalyptic number.
1128453120 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 1128453120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2029674192).
1128453120 is an abundant number, since it is smaller than the sum of its proper divisors (2930895264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1128453120 is an frugal number, since it uses more digits than its factorization.
1128453120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 947 (or 917 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The square root of 1128453120 is about 33592.4562960198. The cubic root of 1128453120 is about 1041.1049400476.
The spelling of 1128453120 in words is "one billion, one hundred twenty-eight million, four hundred fifty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •