Base | Representation |
---|---|
bin | 10101000001111100… |
… | …11011011010100000 |
3 | 1002010212100200002000 |
4 | 22200332123122200 |
5 | 141110401414433 |
6 | 5104205524000 |
7 | 546535656450 |
oct | 124076333240 |
9 | 32125320060 |
10 | 11290654368 |
11 | 4874309814 |
12 | 2231273600 |
13 | 10ac202696 |
14 | 79172dd60 |
15 | 461354113 |
hex | 2a0f9b6a0 |
11290654368 has 288 divisors, whose sum is σ = 39354134400. Its totient is φ = 3084770304.
The previous prime is 11290654337. The next prime is 11290654379. The reversal of 11290654368 is 86345609211.
11290654368 is a `hidden beast` number, since 1 + 12 + 90 + 6 + 543 + 6 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (288).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3197628 + ... + 3201156.
It is an arithmetic number, because the mean of its divisors is an integer number (136646300).
Almost surely, 211290654368 is an apocalyptic number.
11290654368 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11290654368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19677067200).
11290654368 is an abundant number, since it is smaller than the sum of its proper divisors (28063480032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11290654368 is a wasteful number, since it uses less digits than its factorization.
11290654368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3601 (or 3564 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 45.
The spelling of 11290654368 in words is "eleven billion, two hundred ninety million, six hundred fifty-four thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •