Base | Representation |
---|---|
bin | 110100011010000001… |
… | …0000101000110101001 |
3 | 101202111020211112212210 |
4 | 1220310002011012221 |
5 | 3320441240010441 |
6 | 123411235555333 |
7 | 11062620103140 |
oct | 1506402050651 |
9 | 352436745783 |
10 | 112542110121 |
11 | 438020a6071 |
12 | 1998a15bb49 |
13 | a7c708148c |
14 | 5638a76757 |
15 | 2dda390616 |
hex | 1a340851a9 |
112542110121 has 8 divisors (see below), whose sum is σ = 171492739264. Its totient is φ = 64309777200.
The previous prime is 112542110089. The next prime is 112542110123. The reversal of 112542110121 is 121011245211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112542110121 - 25 = 112542110089 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 5359148101 = 112542110121 / (1 + 1 + 2 + 5 + 4 + 2 + 1 + 1 + 0 + 1 + 2 + 1).
It is not an unprimeable number, because it can be changed into a prime (112542110123) 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, 2679574030 + ... + 2679574071.
It is an arithmetic number, because the mean of its divisors is an integer number (21436592408).
Almost surely, 2112542110121 is an apocalyptic number.
It is an amenable number.
112542110121 is a deficient number, since it is larger than the sum of its proper divisors (58950629143).
112542110121 is an equidigital number, since it uses as much as digits as its factorization.
112542110121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5359148111.
The product of its (nonzero) digits is 160, while the sum is 21.
Adding to 112542110121 its reverse (121011245211), we get a palindrome (233553355332).
The spelling of 112542110121 in words is "one hundred twelve billion, five hundred forty-two million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •