Base | Representation |
---|---|
bin | 10101000011001101… |
… | …01101010000010000 |
3 | 1002011121020010001212 |
4 | 22201212231100100 |
5 | 141121102310300 |
6 | 5105224115252 |
7 | 550024504304 |
oct | 124146552020 |
9 | 32147203055 |
10 | 11301213200 |
11 | 487a270822 |
12 | 2234905b28 |
13 | 10b145b704 |
14 | 792cbbd04 |
15 | 46223c935 |
hex | 2a19ad410 |
11301213200 has 120 divisors (see below), whose sum is σ = 27524577600. Its totient is φ = 4458688000.
The previous prime is 11301213197. The next prime is 11301213221. The reversal of 11301213200 is 231210311.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18866501 + ... + 18867099.
It is an arithmetic number, because the mean of its divisors is an integer number (229371480).
Almost surely, 211301213200 is an apocalyptic number.
11301213200 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 11301213200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13762288800).
11301213200 is an abundant number, since it is smaller than the sum of its proper divisors (16223364400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11301213200 is a wasteful number, since it uses less digits than its factorization.
11301213200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1185 (or 1174 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 11301213200 its reverse (231210311), we get a palindrome (11532423511).
The spelling of 11301213200 in words is "eleven billion, three hundred one million, two hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •