Base | Representation |
---|---|
bin | 10100010111000010… |
… | …00011010100000000 |
3 | 1001012202220122010212 |
4 | 22023201003110000 |
5 | 134341220210221 |
6 | 5004345213252 |
7 | 534604560410 |
oct | 121341032400 |
9 | 31182818125 |
10 | 10930631936 |
11 | 46aa069614 |
12 | 2150791228 |
13 | 105274a663 |
14 | 7599b4640 |
15 | 43e93ab5b |
hex | 28b843500 |
10930631936 has 72 divisors (see below), whose sum is σ = 25132369920. Its totient is φ = 4647573504.
The previous prime is 10930631917. The next prime is 10930631951. The reversal of 10930631936 is 63913603901.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10930631893 and 10930631902.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 203570 + ... + 251598.
Almost surely, 210930631936 is an apocalyptic number.
10930631936 is a gapful number since it is divisible by the number (16) 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 10930631936, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12566184960).
10930631936 is an abundant number, since it is smaller than the sum of its proper divisors (14201737984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10930631936 is an equidigital number, since it uses as much as digits as its factorization.
10930631936 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48179 (or 48165 counting only the distinct ones).
The product of its (nonzero) digits is 78732, while the sum is 41.
The spelling of 10930631936 in words is "ten billion, nine hundred thirty million, six hundred thirty-one thousand, nine hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •