Base | Representation |
---|---|
bin | 10011001001101110… |
… | …01000010010000000 |
3 | 222112120121012121000 |
4 | 21210313020102000 |
5 | 132024204424112 |
6 | 4420141132000 |
7 | 512541322230 |
oct | 114467102200 |
9 | 28476535530 |
10 | 10282108032 |
11 | 43a6a88a49 |
12 | 1bab55a000 |
13 | c7b2924c1 |
14 | 6d77d9cc0 |
15 | 402a357dc |
hex | 264dc8480 |
10282108032 has 256 divisors, whose sum is σ = 35423539200. Its totient is φ = 2874921984.
The previous prime is 10282108009. The next prime is 10282108051. The reversal of 10282108032 is 23080128201.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 10282107987 and 10282108005.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1132503 + ... + 1141545.
It is an arithmetic number, because the mean of its divisors is an integer number (138373200).
Almost surely, 210282108032 is an apocalyptic number.
10282108032 is a gapful number since it is divisible by the number (12) 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 10282108032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17711769600).
10282108032 is an abundant number, since it is smaller than the sum of its proper divisors (25141431168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10282108032 is an equidigital number, since it uses as much as digits as its factorization.
10282108032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9120 (or 9102 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
The spelling of 10282108032 in words is "ten billion, two hundred eighty-two million, one hundred eight thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •