Base | Representation |
---|---|
bin | 110100001101011101… |
… | …1101101111110011000 |
3 | 101201101220110120000112 |
4 | 1220122323231332120 |
5 | 3314110434341440 |
6 | 123301354223452 |
7 | 11046314610155 |
oct | 1503273557630 |
9 | 351356416015 |
10 | 112121012120 |
11 | 4360642a997 |
12 | 19891124b88 |
13 | a75aa63a70 |
14 | 55d8b7d22c |
15 | 2db3410965 |
hex | 1a1aeedf98 |
112121012120 has 32 divisors (see below), whose sum is σ = 271677838320. Its totient is φ = 41398527360.
The previous prime is 112121012077. The next prime is 112121012149. The reversal of 112121012120 is 21210121211.
It is a super-2 number, since 2×1121210121202 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112121012095 and 112121012104.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 107808146 + ... + 107809185.
Almost surely, 2112121012120 is an apocalyptic number.
112121012120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112121012120 is an abundant number, since it is smaller than the sum of its proper divisors (159556826200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112121012120 is a wasteful number, since it uses less digits than its factorization.
112121012120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 215617355 (or 215617351 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112121012120 its reverse (21210121211), we get a palindrome (133331133331).
It can be divided in two parts, 1 and 12121012120, that added together give a palindrome (12121012121).
The spelling of 112121012120 in words is "one hundred twelve billion, one hundred twenty-one million, twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •