Base | Representation |
---|---|
bin | 110100010111101110… |
… | …0000000100100011101 |
3 | 101202021212210000210001 |
4 | 1220233130000210131 |
5 | 3320312021134323 |
6 | 123355443414301 |
7 | 11060662623136 |
oct | 1505734004435 |
9 | 352255700701 |
10 | 112465021213 |
11 | 43772633026 |
12 | 19968384391 |
13 | a7b410013c |
14 | 562c72ac8d |
15 | 2dd37143ad |
hex | 1a2f70091d |
112465021213 has 8 divisors (see below), whose sum is σ = 117361604736. Its totient is φ = 107569004400.
The previous prime is 112465021129. The next prime is 112465021231. The reversal of 112465021213 is 312120564211.
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 112465021213 - 213 = 112465013021 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 (112465022213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 292168 + ... + 557038.
It is an arithmetic number, because the mean of its divisors is an integer number (14670200592).
Almost surely, 2112465021213 is an apocalyptic number.
It is an amenable number.
112465021213 is a deficient number, since it is larger than the sum of its proper divisors (4896583523).
112465021213 is a wasteful number, since it uses less digits than its factorization.
112465021213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283355.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 112465021213 its reverse (312120564211), we get a palindrome (424585585424).
The spelling of 112465021213 in words is "one hundred twelve billion, four hundred sixty-five million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •