Base | Representation |
---|---|
bin | 10101000101100100… |
… | …10000111011000000 |
3 | 1002012222111102000121 |
4 | 22202302100323000 |
5 | 141141140120341 |
6 | 5111212430024 |
7 | 550355040331 |
oct | 124262207300 |
9 | 32188442017 |
10 | 11321020096 |
11 | 488a469a61 |
12 | 223b478314 |
13 | 10b55a4c79 |
14 | 795796288 |
15 | 463d514d1 |
hex | 2a2c90ec0 |
11321020096 has 56 divisors (see below), whose sum is σ = 22966801920. Its totient is φ = 5534360832.
The previous prime is 11321020063. The next prime is 11321020099. The reversal of 11321020096 is 69002012311.
It is a self number, because there is not a number n which added to its sum of digits gives 11321020096.
It is not an unprimeable number, because it can be changed into a prime (11321020099) 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 7 ways as a sum of consecutive naturals, for example, 5651031 + ... + 5653033.
Almost surely, 211321020096 is an apocalyptic number.
11321020096 is a gapful number since it is divisible by the number (16) 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 11321020096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11483400960).
11321020096 is an abundant number, since it is smaller than the sum of its proper divisors (11645781824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11321020096 is a wasteful number, since it uses less digits than its factorization.
11321020096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3941 (or 3931 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 25.
The spelling of 11321020096 in words is "eleven billion, three hundred twenty-one million, twenty thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •