Base | Representation |
---|---|
bin | 10101000010001010… |
… | …01100001011100010 |
3 | 1002010222200201122020 |
4 | 22201011030023202 |
5 | 141111330130403 |
6 | 5104311522310 |
7 | 546560021430 |
oct | 124105141342 |
9 | 32128621566 |
10 | 11292426978 |
11 | 487530a588 |
12 | 2231989396 |
13 | 10ac6a3471 |
14 | 791a71d50 |
15 | 4615a4453 |
hex | 2a114c2e2 |
11292426978 has 256 divisors, whose sum is σ = 29727129600. Its totient is φ = 2785052160.
The previous prime is 11292426967. The next prime is 11292426989. The reversal of 11292426978 is 87962429211.
It is an interprime number because it is at equal distance from previous prime (11292426967) and next prime (11292426989).
It is a self number, because there is not a number n which added to its sum of digits gives 11292426978.
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 127 ways as a sum of consecutive naturals, for example, 50638575 + ... + 50638797.
It is an arithmetic number, because the mean of its divisors is an integer number (116121600).
Almost surely, 211292426978 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11292426978, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14863564800).
11292426978 is an abundant number, since it is smaller than the sum of its proper divisors (18434702622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11292426978 is a wasteful number, since it uses less digits than its factorization.
11292426978 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397.
The product of its digits is 870912, while the sum is 51.
The spelling of 11292426978 in words is "eleven billion, two hundred ninety-two million, four hundred twenty-six thousand, nine hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •