Base | Representation |
---|---|
bin | 110100001011001001… |
… | …0111101110011110101 |
3 | 101201012111002022120210 |
4 | 1220112102331303311 |
5 | 3313431031021323 |
6 | 123245535020033 |
7 | 11044351441461 |
oct | 1502622756365 |
9 | 351174068523 |
10 | 112043220213 |
11 | 43576527761 |
12 | 1986b06a619 |
13 | a7478c7752 |
14 | 55cc6cd4a1 |
15 | 2dab696293 |
hex | 1a164bdcf5 |
112043220213 has 4 divisors (see below), whose sum is σ = 149390960288. Its totient is φ = 74695480140.
The previous prime is 112043220181. The next prime is 112043220227. The reversal of 112043220213 is 312022340211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 112043220213 - 25 = 112043220181 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112043220213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112043220313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18673870033 + ... + 18673870038.
It is an arithmetic number, because the mean of its divisors is an integer number (37347740072).
Almost surely, 2112043220213 is an apocalyptic number.
It is an amenable number.
112043220213 is a deficient number, since it is larger than the sum of its proper divisors (37347740075).
112043220213 is an equidigital number, since it uses as much as digits as its factorization.
112043220213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37347740074.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 112043220213 its reverse (312022340211), we get a palindrome (424065560424).
The spelling of 112043220213 in words is "one hundred twelve billion, forty-three million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •