Base | Representation |
---|---|
bin | 10110101110011111… |
… | …11000111000110000 |
3 | 1011111022201020111202 |
4 | 23113033320320300 |
5 | 144442001414300 |
6 | 5334414030332 |
7 | 611233333106 |
oct | 132717707060 |
9 | 34438636452 |
10 | 12201201200 |
11 | 51a1295061 |
12 | 24461a83a8 |
13 | 11c5a4c7a6 |
14 | 83a633c76 |
15 | 4b6265ad5 |
hex | 2d73f8e30 |
12201201200 has 60 divisors (see below), whose sum is σ = 29425097328. Its totient is φ = 4861881600.
The previous prime is 12201201169. The next prime is 12201201209. The reversal of 12201201200 is 210210221.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (12201201209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 47210 + ... + 163190.
Almost surely, 212201201200 is an apocalyptic number.
12201201200 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 12201201200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14712548664).
12201201200 is an abundant number, since it is smaller than the sum of its proper divisors (17223896128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12201201200 is a wasteful number, since it uses less digits than its factorization.
12201201200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116262 (or 116251 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 12201201200 its reverse (210210221), we get a palindrome (12411411421).
The spelling of 12201201200 in words is "twelve billion, two hundred one million, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •