Base | Representation |
---|---|
bin | 10001100111111011001… |
… | …100101010011110110000 |
3 | 11021210001122201021000211 |
4 | 101213323030222132300 |
5 | 124320313123223440 |
6 | 2324212144353504 |
7 | 153333122640412 |
oct | 21477314523660 |
9 | 4253048637024 |
10 | 1211100211120 |
11 | 42769654aa98 |
12 | 176877015894 |
13 | 8a28b1cac77 |
14 | 428908429b2 |
15 | 21784471eea |
hex | 119fb32a7b0 |
1211100211120 has 40 divisors (see below), whose sum is σ = 2816181221616. Its totient is φ = 484375872768.
The previous prime is 1211100211117. The next prime is 1211100211121. The reversal of 1211100211120 is 211120011121.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 1211100211120.
It is not an unprimeable number, because it can be changed into a prime (1211100211121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 393682 + ... + 1605361.
Almost surely, 21211100211120 is an apocalyptic number.
1211100211120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1211100211120 is an abundant number, since it is smaller than the sum of its proper divisors (1605081010496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1211100211120 is a wasteful number, since it uses less digits than its factorization.
1211100211120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2006629 (or 2006623 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1211100211120 its reverse (211120011121), we get a palindrome (1422220222241).
The spelling of 1211100211120 in words is "one trillion, two hundred eleven billion, one hundred million, two hundred eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •