Base | Representation |
---|---|
bin | 10100011000000111… |
… | …11010010000000110 |
3 | 1001020102002220000120 |
4 | 22030003322100012 |
5 | 134401040113422 |
6 | 5005313122410 |
7 | 535045336530 |
oct | 121403722006 |
9 | 31212086016 |
10 | 10939769862 |
11 | 470424001a |
12 | 2153859406 |
13 | 10545c9a08 |
14 | 75acb2850 |
15 | 44064345c |
hex | 28c0fa406 |
10939769862 has 64 divisors (see below), whose sum is σ = 25947537408. Its totient is φ = 3008916000.
The previous prime is 10939769851. The next prime is 10939769873. The reversal of 10939769862 is 26896793901.
It is an interprime number because it is at equal distance from previous prime (10939769851) and next prime (10939769873).
It is a junction number, because it is equal to n+sod(n) for n = 10939769796 and 10939769805.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 226687 + ... + 270677.
It is an arithmetic number, because the mean of its divisors is an integer number (405430272).
Almost surely, 210939769862 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10939769862, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12973768704).
10939769862 is an abundant number, since it is smaller than the sum of its proper divisors (15007767546).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10939769862 is a wasteful number, since it uses less digits than its factorization.
10939769862 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44225.
The product of its (nonzero) digits is 8817984, while the sum is 60.
The spelling of 10939769862 in words is "ten billion, nine hundred thirty-nine million, seven hundred sixty-nine thousand, eight hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •