Base | Representation |
---|---|
bin | 11110101110000001011… |
… | …110100000101000110000 |
3 | 21110210212022012010012002 |
4 | 132232001132200220300 |
5 | 234041312301414300 |
6 | 4253440333553132 |
7 | 305341402101323 |
oct | 36560136405060 |
9 | 7423768163162 |
10 | 2111001201200 |
11 | 7442a8165201 |
12 | 2a11620457a8 |
13 | 1240b32cc108 |
14 | 7425ca147ba |
15 | 39da2e425d5 |
hex | 1eb817a0a30 |
2111001201200 has 120 divisors (see below), whose sum is σ = 5108603809680. Its totient is φ = 838268928000.
The previous prime is 2111001201193. The next prime is 2111001201241. The reversal of 2111001201200 is 21021001112.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 43007072 + ... + 43056128.
It is an arithmetic number, because the mean of its divisors is an integer number (42571698414).
Almost surely, 22111001201200 is an apocalyptic number.
2111001201200 is a gapful number since it is divisible by the number (20) 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 2111001201200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2554301904840).
2111001201200 is an abundant number, since it is smaller than the sum of its proper divisors (2997602608480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111001201200 is a wasteful number, since it uses less digits than its factorization.
2111001201200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49855 (or 49844 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2111001201200 its reverse (21021001112), we get a palindrome (2132022202312).
The spelling of 2111001201200 in words is "two trillion, one hundred eleven billion, one million, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •