Base | Representation |
---|---|
bin | 110100001101011110… |
… | …0000101110111110001 |
3 | 101201101220122112021202 |
4 | 1220122330011313301 |
5 | 3314111001010001 |
6 | 123301400300545 |
7 | 11046315465425 |
oct | 1503274056761 |
9 | 351356575252 |
10 | 112121110001 |
11 | 4360649748a |
12 | 19891171755 |
13 | a75aa99494 |
14 | 55d8ba6b85 |
15 | 2db342e96b |
hex | 1a1af05df1 |
112121110001 has 8 divisors (see below), whose sum is σ = 115165583904. Its totient is φ = 109116960480.
The previous prime is 112121109923. The next prime is 112121110039. The reversal of 112121110001 is 100011121211.
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 112121110001 - 222 = 112116915697 is a prime.
It is a super-2 number, since 2×1121211100012 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (112121110601) 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, 10075460 + ... + 10086581.
It is an arithmetic number, because the mean of its divisors is an integer number (14395697988).
Almost surely, 2112121110001 is an apocalyptic number.
It is an amenable number.
112121110001 is a deficient number, since it is larger than the sum of its proper divisors (3044473903).
112121110001 is an equidigital number, since it uses as much as digits as its factorization.
112121110001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20162191.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 112121110001 its reverse (100011121211), we get a palindrome (212132231212).
It can be divided in two parts, 1121211 and 10001, that multiplied together give a palindrome (11213231211).
The spelling of 112121110001 in words is "one hundred twelve billion, one hundred twenty-one million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •