Base | Representation |
---|---|
bin | 11001100100010000001001… |
… | …011101011110010011111011 |
3 | 112202010101111100210201220121 |
4 | 121210100021131132103323 |
5 | 104214224020021434210 |
6 | 1035051154314234111 |
7 | 32453460361502656 |
oct | 3144201135362373 |
9 | 482111440721817 |
10 | 112442402530555 |
11 | 32911611952159 |
12 | 10740111125937 |
13 | 4a98371bb9b16 |
14 | 1daa35427c89d |
15 | ceed419966da |
hex | 66440975e4fb |
112442402530555 has 8 divisors (see below), whose sum is σ = 134931570883344. Its totient is φ = 89953463460000.
The previous prime is 112442402530553. The next prime is 112442402530567. The reversal of 112442402530555 is 555035204244211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112442402530555 - 21 = 112442402530553 is a prime.
It is a super-2 number, since 2×1124424025305552 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112442402530553) 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, 56239801 + ... + 58204810.
It is an arithmetic number, because the mean of its divisors is an integer number (16866446360418).
Almost surely, 2112442402530555 is an apocalyptic number.
112442402530555 is a deficient number, since it is larger than the sum of its proper divisors (22489168352789).
112442402530555 is a wasteful number, since it uses less digits than its factorization.
112442402530555 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114641117.
The product of its (nonzero) digits is 960000, while the sum is 43.
Adding to 112442402530555 its reverse (555035204244211), we get a palindrome (667477606774766).
The spelling of 112442402530555 in words is "one hundred twelve trillion, four hundred forty-two billion, four hundred two million, five hundred thirty thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •