Base | Representation |
---|---|
bin | 10101010000010100… |
… | …10110011111100010 |
3 | 1002110021020001122110 |
4 | 22220022112133202 |
5 | 141332233023300 |
6 | 5124154020150 |
7 | 552531526200 |
oct | 125012263742 |
9 | 32407201573 |
10 | 11411220450 |
11 | 4926377903 |
12 | 2265717656 |
13 | 10cb197166 |
14 | 7a3756070 |
15 | 46bc1c550 |
hex | 2a82967e2 |
11411220450 has 288 divisors, whose sum is σ = 35515851840. Its totient is φ = 2409523200.
The previous prime is 11411220439. The next prime is 11411220479. The reversal of 11411220450 is 5402211411.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 5724654 + ... + 5726646.
It is an arithmetic number, because the mean of its divisors is an integer number (123318930).
Almost surely, 211411220450 is an apocalyptic number.
11411220450 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 11411220450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17757925920).
11411220450 is an abundant number, since it is smaller than the sum of its proper divisors (24104631390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11411220450 is a wasteful number, since it uses less digits than its factorization.
11411220450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2082 (or 2070 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 21.
Adding to 11411220450 its reverse (5402211411), we get a palindrome (16813431861).
The spelling of 11411220450 in words is "eleven billion, four hundred eleven million, two hundred twenty thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •