Base | Representation |
---|---|
bin | 11001100101110100011001… |
… | …000100101101010111011001 |
3 | 112202111200022201011110122202 |
4 | 121211310121010231113121 |
5 | 104223004434344001343 |
6 | 1035212435102055545 |
7 | 32464320610461155 |
oct | 3145643104552731 |
9 | 482450281143582 |
10 | 112550038656473 |
11 | 32953226714720 |
12 | 10758b5027a5b5 |
13 | 4aa5566739462 |
14 | 1db1645528065 |
15 | d02a412a1db8 |
hex | 665d1912d5d9 |
112550038656473 has 8 divisors (see below), whose sum is σ = 124511182330176. Its totient is φ = 100877115312400.
The previous prime is 112550038656439. The next prime is 112550038656493. The reversal of 112550038656473 is 374656830055211.
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 112550038656473 - 214 = 112550038640089 is a prime.
It is a super-2 number, since 2×1125500386564732 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (112550038656493) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72055081586 + ... + 72055083147.
It is an arithmetic number, because the mean of its divisors is an integer number (15563897791272).
Almost surely, 2112550038656473 is an apocalyptic number.
It is an amenable number.
112550038656473 is a deficient number, since it is larger than the sum of its proper divisors (11961143673703).
112550038656473 is a wasteful number, since it uses less digits than its factorization.
112550038656473 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 144110164815.
The product of its (nonzero) digits is 18144000, while the sum is 56.
The spelling of 112550038656473 in words is "one hundred twelve trillion, five hundred fifty billion, thirty-eight million, six hundred fifty-six thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •