Base | Representation |
---|---|
bin | 10100001000000100… |
… | …00010011000001100 |
3 | 1000220000121222101100 |
4 | 22010002002120030 |
5 | 134112043424012 |
6 | 4544101543100 |
7 | 531521334645 |
oct | 120402023014 |
9 | 30800558340 |
10 | 10805061132 |
11 | 46451a2398 |
12 | 2116714a90 |
13 | 1032722bc8 |
14 | 7470486cc |
15 | 4338d48dc |
hex | 28408260c |
10805061132 has 72 divisors (see below), whose sum is σ = 28765900800. Its totient is φ = 3410274528.
The previous prime is 10805061131. The next prime is 10805061133. The reversal of 10805061132 is 23116050801.
10805061132 is a `hidden beast` number, since 10 + 8 + 0 + 5 + 0 + 611 + 32 = 666.
It is an interprime number because it is at equal distance from previous prime (10805061131) and next prime (10805061133).
It is a junction number, because it is equal to n+sod(n) for n = 10805061096 and 10805061105.
It is not an unprimeable number, because it can be changed into a prime (10805061131) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1834969 + ... + 1840847.
It is an arithmetic number, because the mean of its divisors is an integer number (399526400).
Almost surely, 210805061132 is an apocalyptic number.
10805061132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10805061132 is an abundant number, since it is smaller than the sum of its proper divisors (17960839668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10805061132 is a wasteful number, since it uses less digits than its factorization.
10805061132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8595 (or 8590 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The spelling of 10805061132 in words is "ten billion, eight hundred five million, sixty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •