Base | Representation |
---|---|
bin | 11101010010110111010… |
… | …011101111101100000000 |
3 | 21010110012210122001012012 |
4 | 131102313103233230000 |
5 | 230440332221213440 |
6 | 4140451542152052 |
7 | 265304664344522 |
oct | 35226723575400 |
9 | 7113183561165 |
10 | 2013120101120 |
11 | 7068398a6a67 |
12 | 2861a5a22628 |
13 | 117ab479700b |
14 | 6d61515da12 |
15 | 37574c54e65 |
hex | 1d4b74efb00 |
2013120101120 has 72 divisors (see below), whose sum is σ = 4903781616720. Its totient is φ = 791599738880.
The previous prime is 2013120101099. The next prime is 2013120101123. The reversal of 2013120101120 is 211010213102.
It is a junction number, because it is equal to n+sod(n) for n = 2013120101095 and 2013120101104.
It is not an unprimeable number, because it can be changed into a prime (2013120101123) 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, 13252871 + ... + 13403910.
It is an arithmetic number, because the mean of its divisors is an integer number (68108078010).
Almost surely, 22013120101120 is an apocalyptic number.
2013120101120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2013120101120 is an abundant number, since it is smaller than the sum of its proper divisors (2890661515600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2013120101120 is an equidigital number, since it uses as much as digits as its factorization.
2013120101120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26656861 (or 26656847 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 2013120101120 its reverse (211010213102), we get a palindrome (2224130314222).
The spelling of 2013120101120 in words is "two trillion, thirteen billion, one hundred twenty million, one hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •