Base | Representation |
---|---|
bin | 10101011110101001… |
… | …10100110001110010 |
3 | 1002202122101010211210 |
4 | 22233110310301302 |
5 | 142104020001300 |
6 | 5144130020550 |
7 | 555521223534 |
oct | 125724646162 |
9 | 32678333753 |
10 | 11531406450 |
11 | 49881a6383 |
12 | 2299a17756 |
13 | 111a057935 |
14 | 7b56bd854 |
15 | 47755d050 |
hex | 2af534c72 |
11531406450 has 96 divisors (see below), whose sum is σ = 29282054400. Its totient is φ = 3002227200.
The previous prime is 11531406437. The next prime is 11531406461. The reversal of 11531406450 is 5460413511.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 1248951 + ... + 1258149.
It is an arithmetic number, because the mean of its divisors is an integer number (305021400).
Almost surely, 211531406450 is an apocalyptic number.
11531406450 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 11531406450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14641027200).
11531406450 is an abundant number, since it is smaller than the sum of its proper divisors (17750647950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11531406450 is a wasteful number, since it uses less digits than its factorization.
11531406450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9412 (or 9407 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 11531406450 its reverse (5460413511), we get a palindrome (16991819961).
The spelling of 11531406450 in words is "eleven billion, five hundred thirty-one million, four hundred six thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •