Base | Representation |
---|---|
bin | 11001100100011011000011… |
… | …100111000100001000000000 |
3 | 112202011111201122220100021221 |
4 | 121210123003213010020000 |
5 | 104214422012034312004 |
6 | 1035100412452524424 |
7 | 32454353546446642 |
oct | 3144330347041000 |
9 | 482144648810257 |
10 | 112454115541504 |
11 | 329165826066a0 |
12 | 1074243b920714 |
13 | 4a994ba75aa29 |
14 | 1daab45b12892 |
15 | d002c9e28354 |
hex | 6646c39c4200 |
112454115541504 has 40 divisors (see below), whose sum is σ = 245114829981648. Its totient is φ = 51115507061760.
The previous prime is 112454115541483. The next prime is 112454115541507. The reversal of 112454115541504 is 405145511454211.
It is a super-2 number, since 2×1124541155415042 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112454115541507) 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 3 ways as a sum of consecutive naturals, for example, 9983491842 + ... + 9983503105.
Almost surely, 2112454115541504 is an apocalyptic number.
It is an amenable number.
112454115541504 is an abundant number, since it is smaller than the sum of its proper divisors (132660714440144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112454115541504 is an equidigital number, since it uses as much as digits as its factorization.
112454115541504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19966994976 (or 19966994960 counting only the distinct ones).
The product of its (nonzero) digits is 320000, while the sum is 43.
Adding to 112454115541504 its reverse (405145511454211), we get a palindrome (517599626995715).
The spelling of 112454115541504 in words is "one hundred twelve trillion, four hundred fifty-four billion, one hundred fifteen million, five hundred forty-one thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •