Base | Representation |
---|---|
bin | 10101011100011000… |
… | …01011010001001000 |
3 | 1002201022112120211212 |
4 | 22232030023101020 |
5 | 142034131041211 |
6 | 5142205512252 |
7 | 555200314526 |
oct | 125614132110 |
9 | 32638476755 |
10 | 11512362056 |
11 | 4978479008 |
12 | 2293572688 |
13 | 111611a470 |
14 | 7b2d63316 |
15 | 475a4a38b |
hex | 2ae30b448 |
11512362056 has 64 divisors (see below), whose sum is σ = 24635923200. Its totient is φ = 4996297728.
The previous prime is 11512362053. The next prime is 11512362091. The reversal of 11512362056 is 65026321511.
It is a super-5 number, since 5×115123620565 (a number of 52 digits) contains 55555 as substring.
It is not an unprimeable number, because it can be changed into a prime (11512362053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2577281 + ... + 2581743.
It is an arithmetic number, because the mean of its divisors is an integer number (384936300).
Almost surely, 211512362056 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 11512362056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12317961600).
11512362056 is an abundant number, since it is smaller than the sum of its proper divisors (13123561144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11512362056 is a wasteful number, since it uses less digits than its factorization.
11512362056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5958 (or 5954 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 32.
Adding to 11512362056 its reverse (65026321511), we get a palindrome (76538683567).
The spelling of 11512362056 in words is "eleven billion, five hundred twelve million, three hundred sixty-two thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •