Base | Representation |
---|---|
bin | 10100101101110000… |
… | …00110011001000000 |
3 | 1001201001112200020202 |
4 | 22112320012121000 |
5 | 140234013120412 |
6 | 5035314224332 |
7 | 542410560230 |
oct | 122670063100 |
9 | 31631480222 |
10 | 11121223232 |
11 | 4797705689 |
12 | 21a45850a8 |
13 | 108308c282 |
14 | 777027cc0 |
15 | 4515373c2 |
hex | 296e06640 |
11121223232 has 56 divisors (see below), whose sum is σ = 25253801664. Its totient is φ = 4760105472.
The previous prime is 11121223229. The next prime is 11121223259. The reversal of 11121223232 is 23232212111.
It is a tau number, because it is divible by the number of its divisors (56).
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 7 ways as a sum of consecutive naturals, for example, 341483 + ... + 372629.
It is an arithmetic number, because the mean of its divisors is an integer number (450960744).
Almost surely, 211121223232 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 11121223232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12626900832).
11121223232 is an abundant number, since it is smaller than the sum of its proper divisors (14132578432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11121223232 is an equidigital number, since it uses as much as digits as its factorization.
11121223232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31963 (or 31953 counting only the distinct ones).
The product of its digits is 288, while the sum is 20.
Adding to 11121223232 its reverse (23232212111), we get a palindrome (34353435343).
The spelling of 11121223232 in words is "eleven billion, one hundred twenty-one million, two hundred twenty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •