Base | Representation |
---|---|
bin | 110100001101100011… |
… | …1101001101110000101 |
3 | 101201102010100111020112 |
4 | 1220123013221232011 |
5 | 3314112234443141 |
6 | 123301545242405 |
7 | 11046353316446 |
oct | 1503307515605 |
9 | 351363314215 |
10 | 112124140421 |
11 | 43608177267 |
12 | 19892193405 |
13 | a75b5ba927 |
14 | 55d93552cd |
15 | 2db382c7eb |
hex | 1a1b1e9b85 |
112124140421 has 8 divisors (see below), whose sum is σ = 117368193024. Its totient is φ = 106910845360.
The previous prime is 112124140379. The next prime is 112124140433. The reversal of 112124140421 is 124041421211.
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 112124140421 - 26 = 112124140357 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112124140481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7681925 + ... + 7696506.
It is an arithmetic number, because the mean of its divisors is an integer number (14671024128).
Almost surely, 2112124140421 is an apocalyptic number.
It is an amenable number.
112124140421 is a deficient number, since it is larger than the sum of its proper divisors (5244052603).
112124140421 is a wasteful number, since it uses less digits than its factorization.
112124140421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15378771.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 112124140421 its reverse (124041421211), we get a palindrome (236165561632).
The spelling of 112124140421 in words is "one hundred twelve billion, one hundred twenty-four million, one hundred forty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •