Base | Representation |
---|---|
bin | 10100010110110101… |
… | …01101011110110010 |
3 | 1001012122210011220201 |
4 | 22023122231132302 |
5 | 134340304012100 |
6 | 5004245425414 |
7 | 534554465164 |
oct | 121332553662 |
9 | 31178704821 |
10 | 10928969650 |
11 | 46a9133725 |
12 | 215010b26a |
13 | 10522b7b61 |
14 | 7596a0934 |
15 | 43e70d36a |
hex | 28b6ad7b2 |
10928969650 has 48 divisors (see below), whose sum is σ = 20922321600. Its totient is φ = 4245595200.
The previous prime is 10928969627. The next prime is 10928969713. The reversal of 10928969650 is 5696982901.
It is a happy number.
It is a super-2 number, since 2×109289696502 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10928969591 and 10928969600.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 214876 + ... + 260824.
It is an arithmetic number, because the mean of its divisors is an integer number (435881700).
Almost surely, 210928969650 is an apocalyptic number.
10928969650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10928969650 is a deficient number, since it is larger than the sum of its proper divisors (9993351950).
10928969650 is a wasteful number, since it uses less digits than its factorization.
10928969650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46099 (or 46094 counting only the distinct ones).
The product of its (nonzero) digits is 2099520, while the sum is 55.
The spelling of 10928969650 in words is "ten billion, nine hundred twenty-eight million, nine hundred sixty-nine thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •