Base | Representation |
---|---|
bin | 110100010000001011… |
… | …0110011110110010111 |
3 | 101201122020200020010121 |
4 | 1220200112303312113 |
5 | 3314302233001101 |
6 | 123314404332411 |
7 | 11051501156326 |
oct | 1504026636627 |
9 | 351566606117 |
10 | 112212000151 |
11 | 43652826609 |
12 | 198b76a4107 |
13 | a773870634 |
14 | 5606ca60bd |
15 | 2dbb3d50a1 |
hex | 1a205b3d97 |
112212000151 has 4 divisors (see below), whose sum is σ = 113749150912. Its totient is φ = 110674849392.
The previous prime is 112212000101. The next prime is 112212000163. The reversal of 112212000151 is 151000212211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 151000212211 = 347 ⋅435159113.
It is a cyclic number.
It is not a de Polignac number, because 112212000151 - 213 = 112211991959 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112212000101) 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 3 ways as a sum of consecutive naturals, for example, 768575271 + ... + 768575416.
It is an arithmetic number, because the mean of its divisors is an integer number (28437287728).
Almost surely, 2112212000151 is an apocalyptic number.
112212000151 is a deficient number, since it is larger than the sum of its proper divisors (1537150761).
112212000151 is an equidigital number, since it uses as much as digits as its factorization.
112212000151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1537150760.
The product of its (nonzero) digits is 40, while the sum is 16.
Adding to 112212000151 its reverse (151000212211), we get a palindrome (263212212362).
The spelling of 112212000151 in words is "one hundred twelve billion, two hundred twelve million, one hundred fifty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •