Base | Representation |
---|---|
bin | 110100010111111100… |
… | …0000010101110001101 |
3 | 101202022101121101111121 |
4 | 1220233320002232031 |
5 | 3320320411320221 |
6 | 123400305120541 |
7 | 11061112241302 |
oct | 1505770025615 |
9 | 352271541447 |
10 | 112472370061 |
11 | 437767a2357 |
12 | 1996a929151 |
13 | a7b57a407c |
14 | 562d6c10a9 |
15 | 2dd41b6a41 |
hex | 1a2fe02b8d |
112472370061 has 4 divisors (see below), whose sum is σ = 112586788512. Its totient is φ = 112357951612.
The previous prime is 112472370053. The next prime is 112472370067. The reversal of 112472370061 is 160073274211.
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 112472370061 - 23 = 112472370053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112472369999 and 112472370026.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112472370067) 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 3 ways as a sum of consecutive naturals, for example, 57207751 + ... + 57209716.
It is an arithmetic number, because the mean of its divisors is an integer number (28146697128).
Almost surely, 2112472370061 is an apocalyptic number.
It is an amenable number.
112472370061 is a deficient number, since it is larger than the sum of its proper divisors (114418451).
112472370061 is an equidigital number, since it uses as much as digits as its factorization.
112472370061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114418450.
The product of its (nonzero) digits is 14112, while the sum is 34.
The spelling of 112472370061 in words is "one hundred twelve billion, four hundred seventy-two million, three hundred seventy thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •