Base | Representation |
---|---|
bin | 10100010110111011… |
… | …11101110010010111 |
3 | 1001012201101112022111 |
4 | 22023131331302113 |
5 | 134341013312441 |
6 | 5004320011451 |
7 | 534564650542 |
oct | 121335756227 |
9 | 31181345274 |
10 | 10929822871 |
11 | 46a9666770 |
12 | 2150460b87 |
13 | 1052526316 |
14 | 759843859 |
15 | 43e82b081 |
hex | 28b77dc97 |
10929822871 has 4 divisors (see below), whose sum is σ = 11923443144. Its totient is φ = 9936202600.
The previous prime is 10929822853. The next prime is 10929822889. The reversal of 10929822871 is 17822892901.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (10929822853) and next prime (10929822889).
It is a cyclic number.
It is not a de Polignac number, because 10929822871 - 227 = 10795605143 is a prime.
It is a super-2 number, since 2×109298228712 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10929822821) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 496810120 + ... + 496810141.
It is an arithmetic number, because the mean of its divisors is an integer number (2980860786).
Almost surely, 210929822871 is an apocalyptic number.
10929822871 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10929822871 is a deficient number, since it is larger than the sum of its proper divisors (993620273).
10929822871 is an equidigital number, since it uses as much as digits as its factorization.
10929822871 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 993620272.
The product of its (nonzero) digits is 290304, while the sum is 49.
The spelling of 10929822871 in words is "ten billion, nine hundred twenty-nine million, eight hundred twenty-two thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •