Base | Representation |
---|---|
bin | 11110101111000011101… |
… | …000011111101111110101 |
3 | 21110220201122200121000222 |
4 | 132233003220133233311 |
5 | 234101100421142003 |
6 | 4254142423144125 |
7 | 305411040155336 |
oct | 36570350375765 |
9 | 7426648617028 |
10 | 2112111115253 |
11 | 744817731047 |
12 | 2a14118a5045 |
13 | 12422c2414a9 |
14 | 743261b428d |
15 | 39e1a5d5c38 |
hex | 1ebc3a1fbf5 |
2112111115253 has 8 divisors (see below), whose sum is σ = 2237465041920. Its totient is φ = 1986880754880.
The previous prime is 2112111115211. The next prime is 2112111115259. The reversal of 2112111115253 is 3525111112112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2112111115253 - 224 = 2112094338037 is a prime.
It is a super-2 number, since 2×21121111152532 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112111115259) 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, 30856373 + ... + 30924746.
It is an arithmetic number, because the mean of its divisors is an integer number (279683130240).
Almost surely, 22112111115253 is an apocalyptic number.
It is an amenable number.
2112111115253 is a deficient number, since it is larger than the sum of its proper divisors (125353926667).
2112111115253 is a wasteful number, since it uses less digits than its factorization.
2112111115253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61783147.
The product of its digits is 600, while the sum is 26.
Adding to 2112111115253 its reverse (3525111112112), we get a palindrome (5637222227365).
The spelling of 2112111115253 in words is "two trillion, one hundred twelve billion, one hundred eleven million, one hundred fifteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •