Base | Representation |
---|---|
bin | 110100010000001100… |
… | …0000100101000000101 |
3 | 101201122021022000222202 |
4 | 1220200120010220011 |
5 | 3314302324043023 |
6 | 123314415404245 |
7 | 11051504035046 |
oct | 1504030045005 |
9 | 351567260882 |
10 | 112212331013 |
11 | 43652a32152 |
12 | 198b7823685 |
13 | a773958103 |
14 | 5606d508cd |
15 | 2dbb44d128 |
hex | 1a20604a05 |
112212331013 has 4 divisors (see below), whose sum is σ = 112215190848. Its totient is φ = 112209471180.
The previous prime is 112212330973. The next prime is 112212331019. The reversal of 112212331013 is 310133212211.
It is a happy number.
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 a cyclic number.
It is not a de Polignac number, because 112212331013 - 226 = 112145222149 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 (112212331019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1370231 + ... + 1449812.
It is an arithmetic number, because the mean of its divisors is an integer number (28053797712).
Almost surely, 2112212331013 is an apocalyptic number.
It is an amenable number.
112212331013 is a deficient number, since it is larger than the sum of its proper divisors (2859835).
112212331013 is an equidigital number, since it uses as much as digits as its factorization.
112212331013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2859834.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 112212331013 its reverse (310133212211), we get a palindrome (422345543224).
The spelling of 112212331013 in words is "one hundred twelve billion, two hundred twelve million, three hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •