Base | Representation |
---|---|
bin | 1010000000010010100001… |
… | …0001110100110000010000 |
3 | 1102221121010222101001102011 |
4 | 2200010220101310300100 |
5 | 2420211134233144344 |
6 | 35221211544232304 |
7 | 2213505260546641 |
oct | 240045021646020 |
9 | 42847128331364 |
10 | 11000087006224 |
11 | 3561124385a88 |
12 | 1297a82a6b694 |
13 | 61a3c4468424 |
14 | 2a059ad436c8 |
15 | 14120e143d34 |
hex | a0128474c10 |
11000087006224 has 160 divisors (see below), whose sum is σ = 23141402784000. Its totient is φ = 5049315532800.
The previous prime is 11000087006221. The next prime is 11000087006287. The reversal of 11000087006224 is 42260078000011.
It is not an unprimeable number, because it can be changed into a prime (11000087006221) by changing a digit.
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, 463755037 + ... + 463778755.
It is an arithmetic number, because the mean of its divisors is an integer number (144633767400).
Almost surely, 211000087006224 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11000087006224, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11570701392000).
11000087006224 is an abundant number, since it is smaller than the sum of its proper divisors (12141315777776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000087006224 is a wasteful number, since it uses less digits than its factorization.
11000087006224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24177 (or 24171 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 31.
The spelling of 11000087006224 in words is "eleven trillion, eighty-seven million, six thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •