Base | Representation |
---|---|
bin | 10100110111111011… |
… | …01011101100100000 |
3 | 1001221000010212220001 |
4 | 22123331223230200 |
5 | 140422340312312 |
6 | 5052003425344 |
7 | 544465204000 |
oct | 123375535440 |
9 | 31830125801 |
10 | 11206572832 |
11 | 4830900044 |
12 | 2209085254 |
13 | 10979735b0 |
14 | 7844c4000 |
15 | 458c96057 |
hex | 29bf6bb20 |
11206572832 has 96 divisors (see below), whose sum is σ = 27708912000. Its totient is φ = 4433313024.
The previous prime is 11206572829. The next prime is 11206572833. The reversal of 11206572832 is 23827560211.
It is a junction number, because it is equal to n+sod(n) for n = 11206572791 and 11206572800.
It is not an unprimeable number, because it can be changed into a prime (11206572833) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 103419 + ... + 181957.
It is an arithmetic number, because the mean of its divisors is an integer number (288634500).
Almost surely, 211206572832 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 11206572832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13854456000).
11206572832 is an abundant number, since it is smaller than the sum of its proper divisors (16502339168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11206572832 is an equidigital number, since it uses as much as digits as its factorization.
11206572832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78583 (or 78561 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 37.
The spelling of 11206572832 in words is "eleven billion, two hundred six million, five hundred seventy-two thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •