Base | Representation |
---|---|
bin | 110100001101110010… |
… | …1101101101111011101 |
3 | 101201102200011212122201 |
4 | 1220123211231233131 |
5 | 3314121244134323 |
6 | 123302430211501 |
7 | 11046510311512 |
oct | 1503345555735 |
9 | 351380155581 |
10 | 112132021213 |
11 | 4361166a213 |
12 | 19894953b91 |
13 | a760119a14 |
14 | 55da407309 |
15 | 2db43878ad |
hex | 1a1b96dbdd |
112132021213 has 8 divisors (see below), whose sum is σ = 118100165120. Its totient is φ = 106170523200.
The previous prime is 112132021207. The next prime is 112132021223. The reversal of 112132021213 is 312120231211.
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 112132021213 - 229 = 111595150301 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112132021223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1626813 + ... + 1694338.
It is an arithmetic number, because the mean of its divisors is an integer number (14762520640).
Almost surely, 2112132021213 is an apocalyptic number.
It is an amenable number.
112132021213 is a deficient number, since it is larger than the sum of its proper divisors (5968143907).
112132021213 is a wasteful number, since it uses less digits than its factorization.
112132021213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3322947.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 112132021213 its reverse (312120231211), we get a palindrome (424252252424).
The spelling of 112132021213 in words is "one hundred twelve billion, one hundred thirty-two million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •