Base | Representation |
---|---|
bin | 11001011101110110111011… |
… | …101100111111101010111000 |
3 | 112200120101100102201010222210 |
4 | 121131312323230333222320 |
5 | 104140024131343443222 |
6 | 1034113250103415120 |
7 | 32406644013664041 |
oct | 3135667354775270 |
9 | 480511312633883 |
10 | 112003011312312 |
11 | 32762234a7853a |
12 | 1068ab25a544a0 |
13 | 4a65ab967b023 |
14 | 1d92d906dd8c8 |
15 | ce36c6c6ad0c |
hex | 65ddbbb3fab8 |
112003011312312 has 32 divisors (see below), whose sum is σ = 296478559357200. Its totient is φ = 35138199627264.
The previous prime is 112003011312263. The next prime is 112003011312319. The reversal of 112003011312312 is 213213110300211.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112003011312319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 137258591887 + ... + 137258592702.
Almost surely, 2112003011312312 is an apocalyptic number.
112003011312312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112003011312312 is an abundant number, since it is smaller than the sum of its proper divisors (184475548044888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112003011312312 is a wasteful number, since it uses less digits than its factorization.
112003011312312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274517184615 (or 274517184611 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 112003011312312 its reverse (213213110300211), we get a palindrome (325216121612523).
The spelling of 112003011312312 in words is "one hundred twelve trillion, three billion, eleven million, three hundred twelve thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •