Base | Representation |
---|---|
bin | 11001100011101011100011… |
… | …000101110110111010100101 |
3 | 112201222122001120212121202211 |
4 | 121203223203011312322211 |
5 | 104213103024122200010 |
6 | 1035021135000403421 |
7 | 32450566463401105 |
oct | 3143534305667245 |
9 | 481878046777684 |
10 | 112403104100005 |
11 | 328a6985a15684 |
12 | 10734584176571 |
13 | 4a9474b2a6114 |
14 | 1da84a6d37205 |
15 | cedce189208a |
hex | 663ae3176ea5 |
112403104100005 has 16 divisors (see below), whose sum is σ = 137693601442800. Its totient is φ = 88062106844160.
The previous prime is 112403104099999. The next prime is 112403104100029. The reversal of 112403104100005 is 500001401304211.
It can be written as a sum of positive squares in 8 ways, for example, as 742508001 + 112402361592004 = 27249^2 + 10601998^2 .
It is not a de Polignac number, because 112403104100005 - 211 = 112403104097957 is a prime.
It is a super-2 number, since 2×1124031041000052 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 804591220 + ... + 804730909.
It is an arithmetic number, because the mean of its divisors is an integer number (8605850090175).
Almost surely, 2112403104100005 is an apocalyptic number.
It is an amenable number.
112403104100005 is a deficient number, since it is larger than the sum of its proper divisors (25290497342795).
112403104100005 is a wasteful number, since it uses less digits than its factorization.
112403104100005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1609322424.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 112403104100005 its reverse (500001401304211), we get a palindrome (612404505404216).
The spelling of 112403104100005 in words is "one hundred twelve trillion, four hundred three billion, one hundred four million, one hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •