Base | Representation |
---|---|
bin | 10101011100001110… |
… | …00010100000011010 |
3 | 1002201020000011122120 |
4 | 22232013002200122 |
5 | 142033304443300 |
6 | 5142121002110 |
7 | 555153005544 |
oct | 125607024032 |
9 | 32636004576 |
10 | 11511015450 |
11 | 4977739310 |
12 | 2293023336 |
13 | 1115a6855c |
14 | 7b2ad2694 |
15 | 4758813a0 |
hex | 2ae1c281a |
11511015450 has 96 divisors (see below), whose sum is σ = 31451326272. Its totient is φ = 2762880000.
The previous prime is 11511015433. The next prime is 11511015487. The reversal of 11511015450 is 5451011511.
It is a self number, because there is not a number n which added to its sum of digits gives 11511015450.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 132114 + ... + 201186.
It is an arithmetic number, because the mean of its divisors is an integer number (327617982).
Almost surely, 211511015450 is an apocalyptic number.
11511015450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11511015450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15725663136).
11511015450 is an abundant number, since it is smaller than the sum of its proper divisors (19940310822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11511015450 is a wasteful number, since it uses less digits than its factorization.
11511015450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69200 (or 69195 counting only the distinct ones).
The product of its (nonzero) digits is 500, while the sum is 24.
Adding to 11511015450 its reverse (5451011511), we get a palindrome (16962026961).
The spelling of 11511015450 in words is "eleven billion, five hundred eleven million, fifteen thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •