Base | Representation |
---|---|
bin | 10101101000010010… |
… | …00010100000110000 |
3 | 1002222021102000221200 |
4 | 22310021002200300 |
5 | 142240210444211 |
6 | 5200133451200 |
7 | 560522045256 |
oct | 126411024060 |
9 | 32867360850 |
10 | 11612203056 |
11 | 4a19871033 |
12 | 2300aa0b00 |
13 | 1130a0678c |
14 | 7c23125d6 |
15 | 47e6bcb56 |
hex | 2b4242830 |
11612203056 has 120 divisors (see below), whose sum is σ = 34472574864. Its totient is φ = 3636387840.
The previous prime is 11612203049. The next prime is 11612203069. The reversal of 11612203056 is 65030221611.
11612203056 is a `hidden beast` number, since 11 + 612 + 2 + 0 + 30 + 5 + 6 = 666.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1432936 + ... + 1441016.
Almost surely, 211612203056 is an apocalyptic number.
11612203056 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 11612203056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17236287432).
11612203056 is an abundant number, since it is smaller than the sum of its proper divisors (22860371808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11612203056 is a wasteful number, since it uses less digits than its factorization.
11612203056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8699 (or 8690 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 11612203056 its reverse (65030221611), we get a palindrome (76642424667).
The spelling of 11612203056 in words is "eleven billion, six hundred twelve million, two hundred three thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •