Base | Representation |
---|---|
bin | 11001011110011101011011… |
… | …110100011100001001110101 |
3 | 112200201100001120010010222201 |
4 | 121132131123310130021311 |
5 | 104141213313143333323 |
6 | 1034144244225024501 |
7 | 32412636333536401 |
oct | 3136353364341165 |
9 | 480640046103881 |
10 | 112044352324213 |
11 | 32778819995681 |
12 | 10696b42a85131 |
13 | 4a699774c784a |
14 | 1d94d93026101 |
15 | ce47e63448ad |
hex | 65e75bd1c275 |
112044352324213 has 4 divisors (see below), whose sum is σ = 114650034936448. Its totient is φ = 109438669711980.
The previous prime is 112044352324159. The next prime is 112044352324217. The reversal of 112044352324213 is 312423253440211.
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 a de Polignac number, because none of the positive numbers 2k-112044352324213 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 (112044352324217) 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, 1302841306053 + ... + 1302841306138.
It is an arithmetic number, because the mean of its divisors is an integer number (28662508734112).
Almost surely, 2112044352324213 is an apocalyptic number.
It is an amenable number.
112044352324213 is a deficient number, since it is larger than the sum of its proper divisors (2605682612235).
112044352324213 is an equidigital number, since it uses as much as digits as its factorization.
112044352324213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2605682612234.
The product of its (nonzero) digits is 138240, while the sum is 37.
The spelling of 112044352324213 in words is "one hundred twelve trillion, forty-four billion, three hundred fifty-two million, three hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •