Base | Representation |
---|---|
bin | 110100010000101101… |
… | …1111001101100001101 |
3 | 101201200111202101221022 |
4 | 1220201123321230031 |
5 | 3314321402041023 |
6 | 123320252443525 |
7 | 11052111132515 |
oct | 1504133715415 |
9 | 351614671838 |
10 | 112230112013 |
11 | 43661a77298 |
12 | 199017795a5 |
13 | a777542506 |
14 | 560945c845 |
15 | 2dbccb17c8 |
hex | 1a216f9b0d |
112230112013 has 8 divisors (see below), whose sum is σ = 114054557760. Its totient is φ = 110412436960.
The previous prime is 112230111949. The next prime is 112230112039. The reversal of 112230112013 is 310211032211.
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 112230112013 - 26 = 112230111949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112230111982 and 112230112000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112230112063) 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, 1659248 + ... + 1725561.
It is an arithmetic number, because the mean of its divisors is an integer number (14256819720).
Almost surely, 2112230112013 is an apocalyptic number.
It is an amenable number.
112230112013 is a deficient number, since it is larger than the sum of its proper divisors (1824445747).
112230112013 is an equidigital number, since it uses as much as digits as its factorization.
112230112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3385347.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 112230112013 its reverse (310211032211), we get a palindrome (422441144224).
The spelling of 112230112013 in words is "one hundred twelve billion, two hundred thirty million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •