Base | Representation |
---|---|
bin | 110100001101011101… |
… | …1101101011101010001 |
3 | 101201101220110110010001 |
4 | 1220122323231131101 |
5 | 3314110434310001 |
6 | 123301354210001 |
7 | 11046314601040 |
oct | 1503273553521 |
9 | 351356413101 |
10 | 112121010001 |
11 | 43606429340 |
12 | 19891123901 |
13 | a75aa62b00 |
14 | 55d8b7c557 |
15 | 2db3410001 |
hex | 1a1aeed751 |
112121010001 has 48 divisors (see below), whose sum is σ = 151974724608. Its totient is φ = 80322840000.
The previous prime is 112121009999. The next prime is 112121010017. The reversal of 112121010001 is 100010121211.
It is not a de Polignac number, because 112121010001 - 21 = 112121009999 is a prime.
It is a super-2 number, since 2×1121210100012 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112121010001.
It is not an unprimeable number, because it can be changed into a prime (112121014001) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3249100 + ... + 3283426.
It is an arithmetic number, because the mean of its divisors is an integer number (3166140096).
Almost surely, 2112121010001 is an apocalyptic number.
112121010001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112121010001 is a deficient number, since it is larger than the sum of its proper divisors (39853714607).
112121010001 is a wasteful number, since it uses less digits than its factorization.
112121010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34622 (or 34609 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 112121010001 its reverse (100010121211), we get a palindrome (212131131212).
The spelling of 112121010001 in words is "one hundred twelve billion, one hundred twenty-one million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •