Base | Representation |
---|---|
bin | 10100001010101100… |
… | …01010011111110000 |
3 | 1000221120010101220000 |
4 | 22011112022133300 |
5 | 134133220130410 |
6 | 4550210350000 |
7 | 532206645300 |
oct | 120526123760 |
9 | 30846111800 |
10 | 10827114480 |
11 | 46566953a6 |
12 | 2121b8b300 |
13 | 1037174b20 |
14 | 749d49600 |
15 | 4357dddc0 |
hex | 28558a7f0 |
10827114480 has 1200 divisors, whose sum is σ = 48994301664. Its totient is φ = 2194698240.
The previous prime is 10827114469. The next prime is 10827114481. The reversal of 10827114480 is 8441172801.
10827114480 is a `hidden beast` number, since 108 + 2 + 71 + 1 + 4 + 480 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10827114481) by changing a digit.
It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 177493650 + ... + 177493710.
Almost surely, 210827114480 is an apocalyptic number.
10827114480 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 10827114480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24497150832).
10827114480 is an abundant number, since it is smaller than the sum of its proper divisors (38167187184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10827114480 is a wasteful number, since it uses less digits than its factorization.
10827114480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156 (or 134 counting only the distinct ones).
The product of its (nonzero) digits is 14336, while the sum is 36.
The spelling of 10827114480 in words is "ten billion, eight hundred twenty-seven million, one hundred fourteen thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •