Base | Representation |
---|---|
bin | 11101010001000100111… |
… | …011011010101101100000 |
3 | 21010021021001201202111212 |
4 | 131101010323122231200 |
5 | 230422414441333440 |
6 | 4135533311525252 |
7 | 265206303314612 |
oct | 35210473325540 |
9 | 7107231652455 |
10 | 2011201121120 |
11 | 705a44667984 |
12 | 28594b229828 |
13 | 11786a0493a9 |
14 | 6d4b2354db2 |
15 | 374b1548465 |
hex | 1d444edab60 |
2011201121120 has 96 divisors (see below), whose sum is σ = 4950575594496. Its totient is φ = 771253286400.
The previous prime is 2011201121093. The next prime is 2011201121123. The reversal of 2011201121120 is 211211021102.
It is a junction number, because it is equal to n+sod(n) for n = 2011201121095 and 2011201121104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011201121123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1364066 + ... + 2425505.
It is an arithmetic number, because the mean of its divisors is an integer number (51568495776).
Almost surely, 22011201121120 is an apocalyptic number.
2011201121120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2011201121120 is an abundant number, since it is smaller than the sum of its proper divisors (2939374473376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011201121120 is a wasteful number, since it uses less digits than its factorization.
2011201121120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3789724 (or 3789716 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2011201121120 its reverse (211211021102), we get a palindrome (2222412142222).
The spelling of 2011201121120 in words is "two trillion, eleven billion, two hundred one million, one hundred twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •