Base | Representation |
---|---|
bin | 11110101111000011100… |
… | …101000011001110100000 |
3 | 21110220201120222201000011 |
4 | 132233003211003032200 |
5 | 234101100203241000 |
6 | 4254142351534304 |
7 | 305411026404055 |
oct | 36570345031640 |
9 | 7426646881004 |
10 | 2112110212000 |
11 | 744817174458 |
12 | 2a141152a394 |
13 | 12422bcb6319 |
14 | 7432601b02c |
15 | 39e1a4a82ba |
hex | 1ebc39433a0 |
2112110212000 has 48 divisors (see below), whose sum is σ = 5189454800712. Its totient is φ = 844844083200.
The previous prime is 2112110211983. The next prime is 2112110212001. The reversal of 2112110212000 is 2120112112.
It can be written as a sum of positive squares in 4 ways, for example, as 1104760757776 + 1007349454224 = 1051076^2 + 1003668^2 .
It is a super-2 number, since 2×21121102120002 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2112110212001) 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, 264009777 + ... + 264017776.
Almost surely, 22112110212000 is an apocalyptic number.
2112110212000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2112110212000 is an abundant number, since it is smaller than the sum of its proper divisors (3077344588712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112110212000 is an equidigital number, since it uses as much as digits as its factorization.
2112110212000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 528027578 (or 528027560 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2112110212000 its reverse (2120112112), we get a palindrome (2114230324112).
The spelling of 2112110212000 in words is "two trillion, one hundred twelve billion, one hundred ten million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •