Base | Representation |
---|---|
bin | 11110101111000100001… |
… | …010011000111011010011 |
3 | 21110220202021101222220111 |
4 | 132233010022120323103 |
5 | 234101110210001321 |
6 | 4254143341422151 |
7 | 305411205532114 |
oct | 36570412307323 |
9 | 7426667358814 |
10 | 2112120000211 |
11 | 74482174a491 |
12 | 2a141486a957 |
13 | 124231032670 |
14 | 7432744820b |
15 | 39e1b28d5e1 |
hex | 1ebc4298ed3 |
2112120000211 has 32 divisors (see below), whose sum is σ = 2386557992448. Its totient is φ = 1854629187840.
The previous prime is 2112120000197. The next prime is 2112120000253. The reversal of 2112120000211 is 1120000212112.
It is not a de Polignac number, because 2112120000211 - 215 = 2112119967443 is a prime.
It is a super-2 number, since 2×21121200002112 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 2112120000191 and 2112120000200.
It is not an unprimeable number, because it can be changed into a prime (2112120040211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 63580396 + ... + 63613606.
It is an arithmetic number, because the mean of its divisors is an integer number (74579937264).
Almost surely, 22112120000211 is an apocalyptic number.
2112120000211 is a deficient number, since it is larger than the sum of its proper divisors (274437992237).
2112120000211 is a wasteful number, since it uses less digits than its factorization.
2112120000211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34411.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2112120000211 its reverse (1120000212112), we get a palindrome (3232120212323).
The spelling of 2112120000211 in words is "two trillion, one hundred twelve billion, one hundred twenty million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •