Base | Representation |
---|---|
bin | 100110001110001… |
… | …0001100000000000 |
3 | 10022101012202000000 |
4 | 1030130101200000 |
5 | 10111303331003 |
6 | 331132000000 |
7 | 43531621056 |
oct | 11434214000 |
9 | 3271182000 |
10 | 1282480128 |
11 | 5a8a21336 |
12 | 2b9600000 |
13 | 1759126a7 |
14 | c24801d6 |
15 | 778ce1a3 |
hex | 4c711800 |
1282480128 has 168 divisors, whose sum is σ = 3849218100. Its totient is φ = 426995712.
The previous prime is 1282480103. The next prime is 1282480141. The reversal of 1282480128 is 8210842821.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 1282480092 and 1282480101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 1492563 + ... + 1493421.
Almost surely, 21282480128 is an apocalyptic number.
1282480128 is a gapful number since it is divisible by the number (18) 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 1282480128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1924609050).
1282480128 is an abundant number, since it is smaller than the sum of its proper divisors (2566737972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1282480128 is an frugal number, since it uses more digits than its factorization.
1282480128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 899 (or 864 counting only the distinct ones).
The product of its (nonzero) digits is 16384, while the sum is 36.
The square root of 1282480128 is about 35811.7317090364. The cubic root of 1282480128 is about 1086.4678549471.
The spelling of 1282480128 in words is "one billion, two hundred eighty-two million, four hundred eighty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •