Base | Representation |
---|---|
bin | 1101010110100… |
… | …10001110001001 |
3 | 21210202201000000 |
4 | 12223102032021 |
5 | 212133310441 |
6 | 15040433213 |
7 | 2530033056 |
oct | 653221611 |
9 | 253681000 |
10 | 112010121 |
11 | 58254953 |
12 | 31618809 |
13 | 1a28a2a2 |
14 | 10c3a02d |
15 | 9c782b6 |
hex | 6ad2389 |
112010121 has 14 divisors (see below), whose sum is σ = 167939450. Its totient is φ = 74672928.
The previous prime is 112010117. The next prime is 112010123. The reversal of 112010121 is 121010211.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 98724096 + 13286025 = 9936^2 + 3645^2 .
It is not a de Polignac number, because 112010121 - 22 = 112010117 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112010123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 76096 + ... + 77553.
It is an arithmetic number, because the mean of its divisors is an integer number (11995675).
Almost surely, 2112010121 is an apocalyptic number.
It is an amenable number.
112010121 is a deficient number, since it is larger than the sum of its proper divisors (55929329).
112010121 is an frugal number, since it uses more digits than its factorization.
112010121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153667 (or 153652 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The square root of 112010121 is about 10583.4834057601. The cubic root of 112010121 is about 482.0429720702.
Adding to 112010121 its reverse (121010211), we get a palindrome (233020332).
The spelling of 112010121 in words is "one hundred twelve million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •