Base | Representation |
---|---|
bin | 10011110100010010… |
… | …11111011011100010 |
3 | 1000110110121112122020 |
4 | 21322021133123202 |
5 | 133242121233403 |
6 | 4515415522310 |
7 | 524436034050 |
oct | 117211373342 |
9 | 30413545566 |
10 | 10639242978 |
11 | 456a6367a1 |
12 | 208b089396 |
13 | 1007276160 |
14 | 72d0031d0 |
15 | 42407d453 |
hex | 27a25f6e2 |
10639242978 has 64 divisors (see below), whose sum is σ = 26254755072. Its totient is φ = 2798899200.
The previous prime is 10639242893. The next prime is 10639242989. The reversal of 10639242978 is 87924293601.
It is a super-2 number, since 2×106392429782 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10639242978.
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 31 ways as a sum of consecutive naturals, for example, 194650 + ... + 243242.
It is an arithmetic number, because the mean of its divisors is an integer number (410230548).
Almost surely, 210639242978 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10639242978, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13127377536).
10639242978 is an abundant number, since it is smaller than the sum of its proper divisors (15615512094).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10639242978 is a wasteful number, since it uses less digits than its factorization.
10639242978 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49019.
The product of its (nonzero) digits is 1306368, while the sum is 51.
The spelling of 10639242978 in words is "ten billion, six hundred thirty-nine million, two hundred forty-two thousand, nine hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •