Base | Representation |
---|---|
bin | 10101101000001100… |
… | …01001000001001000 |
3 | 1002222012222102201112 |
4 | 22310012021001020 |
5 | 142240012141042 |
6 | 5200105305452 |
7 | 560512432202 |
oct | 126406110110 |
9 | 32865872645 |
10 | 11611443272 |
11 | 4a193a2210 |
12 | 2300795288 |
13 | 11307cb9c0 |
14 | 7c2195772 |
15 | 47e5bc982 |
hex | 2b4189048 |
11611443272 has 64 divisors (see below), whose sum is σ = 25606445760. Its totient is φ = 4866451200.
The previous prime is 11611443251. The next prime is 11611443289. The reversal of 11611443272 is 27234411611.
It is a super-2 number, since 2×116114432722 (a number of 21 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 1105598 + ... + 1116050.
It is an arithmetic number, because the mean of its divisors is an integer number (400100715).
Almost surely, 211611443272 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 11611443272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12803222880).
11611443272 is an abundant number, since it is smaller than the sum of its proper divisors (13995002488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11611443272 is a wasteful number, since it uses less digits than its factorization.
11611443272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11454 (or 11450 counting only the distinct ones).
The product of its digits is 8064, while the sum is 32.
Adding to 11611443272 its reverse (27234411611), we get a palindrome (38845854883).
The spelling of 11611443272 in words is "eleven billion, six hundred eleven million, four hundred forty-three thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •