Base | Representation |
---|---|
bin | 10101010000010011… |
… | …00011111001010000 |
3 | 1002110020211112100112 |
4 | 22220021203321100 |
5 | 141332204410300 |
6 | 5124145340452 |
7 | 552530004026 |
oct | 125011437120 |
9 | 32406745315 |
10 | 11411013200 |
11 | 4926246124 |
12 | 2265637728 |
13 | 10cb123a22 |
14 | 7a3700716 |
15 | 46bbcae35 |
hex | 2a8263e50 |
11411013200 has 120 divisors (see below), whose sum is σ = 28958789376. Its totient is φ = 4314240000.
The previous prime is 11411013191. The next prime is 11411013203. The reversal of 11411013200 is 231011411.
It is a super-2 number, since 2×114110132002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11411013203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 522500 + ... + 543900.
Almost surely, 211411013200 is an apocalyptic number.
11411013200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11411013200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14479394688).
11411013200 is an abundant number, since it is smaller than the sum of its proper divisors (17547776176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11411013200 is a wasteful number, since it uses less digits than its factorization.
11411013200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21493 (or 21482 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 11411013200 its reverse (231011411), we get a palindrome (11642024611).
The spelling of 11411013200 in words is "eleven billion, four hundred eleven million, thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •