Base | Representation |
---|---|
bin | 10100010110111100… |
… | …11100111110111111 |
3 | 1001012201122000121020 |
4 | 22023132130332333 |
5 | 134341031410110 |
6 | 5004322435223 |
7 | 534566022231 |
oct | 121336347677 |
9 | 31181560536 |
10 | 10929950655 |
11 | 46a9743778 |
12 | 2150502b13 |
13 | 105256c530 |
14 | 759878251 |
15 | 43e853d70 |
hex | 28b79cfbf |
10929950655 has 32 divisors (see below), whose sum is σ = 18885726720. Its totient is φ = 5365875840.
The previous prime is 10929950653. The next prime is 10929950671. The reversal of 10929950655 is 55605992901.
It is not a de Polignac number, because 10929950655 - 21 = 10929950653 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10929950598 and 10929950607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10929950653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8061 + ... + 148070.
It is an arithmetic number, because the mean of its divisors is an integer number (590178960).
Almost surely, 210929950655 is an apocalyptic number.
10929950655 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10929950655 is a deficient number, since it is larger than the sum of its proper divisors (7955776065).
10929950655 is a wasteful number, since it uses less digits than its factorization.
10929950655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156511.
The product of its (nonzero) digits is 1093500, while the sum is 51.
The spelling of 10929950655 in words is "ten billion, nine hundred twenty-nine million, nine hundred fifty thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •