Base | Representation |
---|---|
bin | 110100001010001100… |
… | …0011110111001000101 |
3 | 101201010020200001101220 |
4 | 1220110120132321011 |
5 | 3313344321041010 |
6 | 123242430510553 |
7 | 11043511512522 |
oct | 1502430367105 |
9 | 351106601356 |
10 | 112011112005 |
11 | 4355a397351 |
12 | 19860365459 |
13 | a741065000 |
14 | 55c8332149 |
15 | 2da8952970 |
hex | 1a1461ee45 |
112011112005 has 64 divisors (see below), whose sum is σ = 194722080000. Its totient is φ = 54980280576.
The previous prime is 112011111991. The next prime is 112011112009. The reversal of 112011112005 is 500211110211.
It is not a de Polignac number, because 112011112005 - 26 = 112011111941 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112011112009) 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 63 ways as a sum of consecutive naturals, for example, 11496426 + ... + 11506164.
It is an arithmetic number, because the mean of its divisors is an integer number (3042532500).
Almost surely, 2112011112005 is an apocalyptic number.
112011112005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
112011112005 is a deficient number, since it is larger than the sum of its proper divisors (82710967995).
112011112005 is an equidigital number, since it uses as much as digits as its factorization.
112011112005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10135 (or 10109 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 15.
Adding to 112011112005 its reverse (500211110211), we get a palindrome (612222222216).
The spelling of 112011112005 in words is "one hundred twelve billion, eleven million, one hundred twelve thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •