Base | Representation |
---|---|
bin | 10011111010010010… |
… | …00000111000000000 |
3 | 1000120222002022000000 |
4 | 21331021000320000 |
5 | 133342444340342 |
6 | 4524412000000 |
7 | 525615551502 |
oct | 117511007000 |
9 | 30528068000 |
10 | 10689449472 |
11 | 4595a08669 |
12 | 20a3a60000 |
13 | 10147a4540 |
14 | 735951d72 |
15 | 42869944c |
hex | 27d240e00 |
10689449472 has 280 divisors, whose sum is σ = 34501296984. Its totient is φ = 3287568384.
The previous prime is 10689449437. The next prime is 10689449501. The reversal of 10689449472 is 27494498601.
10689449472 is a `hidden beast` number, since 1 + 0 + 6 + 89 + 4 + 494 + 72 = 666.
It is a super-2 number, since 2×106894494722 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 4851123 + ... + 4853325.
Almost surely, 210689449472 is an apocalyptic number.
10689449472 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 10689449472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17250648492).
10689449472 is an abundant number, since it is smaller than the sum of its proper divisors (23811847512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10689449472 is an frugal number, since it uses more digits than its factorization.
10689449472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2252 (or 2221 counting only the distinct ones).
The product of its (nonzero) digits is 3483648, while the sum is 54.
The spelling of 10689449472 in words is "ten billion, six hundred eighty-nine million, four hundred forty-nine thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •