Base | Representation |
---|---|
bin | 1010001100100000100000… |
… | …0100010110100010110000 |
3 | 1110200122222011201001120122 |
4 | 2203020020010112202300 |
5 | 2432131040000014300 |
6 | 35501445232225412 |
7 | 2234616151555640 |
oct | 243101004264260 |
9 | 43618864631518 |
10 | 11210000001200 |
11 | 3632152836010 |
12 | 13106a639b268 |
13 | 6341384310b0 |
14 | 2aa7d17ba520 |
15 | 1468e79dbc85 |
hex | a32081168b0 |
11210000001200 has 480 divisors, whose sum is σ = 37732706952192. Its totient is φ = 3085023744000.
The previous prime is 11210000001169. The next prime is 11210000001217. The reversal of 11210000001200 is 210000001211.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 8600570 + ... + 9817830.
Almost surely, 211210000001200 is an apocalyptic number.
11210000001200 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 11210000001200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18866353476096).
11210000001200 is an abundant number, since it is smaller than the sum of its proper divisors (26522706950992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11210000001200 is a wasteful number, since it uses less digits than its factorization.
11210000001200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1217333 (or 1217322 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 11210000001200 its reverse (210000001211), we get a palindrome (11420000002411).
The spelling of 11210000001200 in words is "eleven trillion, two hundred ten billion, one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •