Base | Representation |
---|---|
bin | 10100010110011101… |
… | …11101110000000000 |
3 | 1001012102222202012100 |
4 | 22023032331300000 |
5 | 134334011444220 |
6 | 5004055430400 |
7 | 534516352224 |
oct | 121316756000 |
9 | 31172882170 |
10 | 10925890560 |
11 | 46a7420322 |
12 | 214b085400 |
13 | 105177a500 |
14 | 7590dc784 |
15 | 43e300d90 |
hex | 28b3bdc00 |
10925890560 has 792 divisors, whose sum is σ = 43477690464. Its totient is φ = 2530344960.
The previous prime is 10925890553. The next prime is 10925890603. The reversal of 10925890560 is 6509852901.
10925890560 is a `hidden beast` number, since 1 + 0 + 9 + 2 + 5 + 89 + 0 + 560 = 666.
It is a super-2 number, since 2×109258905602 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 179112930 + ... + 179112990.
Almost surely, 210925890560 is an apocalyptic number.
10925890560 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 10925890560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21738845232).
10925890560 is an abundant number, since it is smaller than the sum of its proper divisors (32551799904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10925890560 is a wasteful number, since it uses less digits than its factorization.
10925890560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141 (or 107 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 45.
The spelling of 10925890560 in words is "ten billion, nine hundred twenty-five million, eight hundred ninety thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •