Base | Representation |
---|---|
bin | 110100001011101111… |
… | …0100100000010100011 |
3 | 101201020212101010221012 |
4 | 1220113132210002203 |
5 | 3314001114200403 |
6 | 123251523451135 |
7 | 11045012050226 |
oct | 1502736440243 |
9 | 351225333835 |
10 | 112063037603 |
11 | 43586732870 |
12 | 19875826aab |
13 | a74ba45a0a |
14 | 55d11ab5bd |
15 | 2dad2aced8 |
hex | 1a177a40a3 |
112063037603 has 16 divisors (see below), whose sum is σ = 124905300480. Its totient is φ = 99665090400.
The previous prime is 112063037573. The next prime is 112063037651. The reversal of 112063037603 is 306730360211.
It is a cyclic number.
It is not a de Polignac number, because 112063037603 - 26 = 112063037539 is a prime.
It is a super-2 number, since 2×1120630376032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112063037603.
It is not an unprimeable number, because it can be changed into a prime (112063037683) 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 15 ways as a sum of consecutive naturals, for example, 1189748 + ... + 1280478.
It is an arithmetic number, because the mean of its divisors is an integer number (7806581280).
Almost surely, 2112063037603 is an apocalyptic number.
112063037603 is a deficient number, since it is larger than the sum of its proper divisors (12842262877).
112063037603 is a wasteful number, since it uses less digits than its factorization.
112063037603 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93178.
The product of its (nonzero) digits is 13608, while the sum is 32.
Adding to 112063037603 its reverse (306730360211), we get a palindrome (418793397814).
The spelling of 112063037603 in words is "one hundred twelve billion, sixty-three million, thirty-seven thousand, six hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •