Base | Representation |
---|---|
bin | 11110101110000001100… |
… | …001100011111011001100 |
3 | 21110210212100200202110000 |
4 | 132232001201203323030 |
5 | 234041313003013400 |
6 | 4253440403044300 |
7 | 305341411642356 |
oct | 36560141437314 |
9 | 7423770622400 |
10 | 2111002001100 |
11 | 7442a8661183 |
12 | 2a1162370690 |
13 | 1240b351c225 |
14 | 7425cb820d6 |
15 | 39da304e600 |
hex | 1eb81863ecc |
2111002001100 has 360 divisors, whose sum is σ = 7560601903008. Its totient is φ = 506783692800.
The previous prime is 2111002001029. The next prime is 2111002001111. The reversal of 2111002001100 is 11002001112.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 2833830 + ... + 3500370.
Almost surely, 22111002001100 is an apocalyptic number.
2111002001100 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 2111002001100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3780300951504).
2111002001100 is an abundant number, since it is smaller than the sum of its proper divisors (5449599901908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111002001100 is a wasteful number, since it uses less digits than its factorization.
2111002001100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 666607 (or 666591 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2111002001100 its reverse (11002001112), we get a palindrome (2122004002212).
The spelling of 2111002001100 in words is "two trillion, one hundred eleven billion, two million, one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •