Base | Representation |
---|---|
bin | 10100010110111111… |
… | …10100101101101000 |
3 | 1001012202022021112000 |
4 | 22023133310231220 |
5 | 134341124404432 |
6 | 5004334251000 |
7 | 534602046660 |
oct | 121337645550 |
9 | 31182267460 |
10 | 10930309992 |
11 | 46a9969748 |
12 | 2150656a60 |
13 | 1052666c64 |
14 | 75992d1a0 |
15 | 43e8c557c |
hex | 28b7f4b68 |
10930309992 has 128 divisors (see below), whose sum is σ = 35354361600. Its totient is φ = 3063999744.
The previous prime is 10930309961. The next prime is 10930309997. The reversal of 10930309992 is 29990303901.
It is not an unprimeable number, because it can be changed into a prime (10930309997) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11938 + ... + 148334.
It is an arithmetic number, because the mean of its divisors is an integer number (276205950).
Almost surely, 210930309992 is an apocalyptic number.
10930309992 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 10930309992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17677180800).
10930309992 is an abundant number, since it is smaller than the sum of its proper divisors (24424051608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10930309992 is a wasteful number, since it uses less digits than its factorization.
10930309992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136472 (or 136462 counting only the distinct ones).
The product of its (nonzero) digits is 118098, while the sum is 45.
The spelling of 10930309992 in words is "ten billion, nine hundred thirty million, three hundred nine thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •