Base | Representation |
---|---|
bin | 110100101011000000… |
… | …0100000011110101111 |
3 | 101210221222102012222102 |
4 | 1221112000200132233 |
5 | 3323123200421221 |
6 | 123544001205315 |
7 | 11113011120155 |
oct | 1512600403657 |
9 | 353858365872 |
10 | 113112123311 |
11 | 43a74932450 |
12 | 19b0903083b |
13 | a8881ab0a5 |
14 | 56906553d5 |
15 | 2e2043830b |
hex | 1a560207af |
113112123311 has 8 divisors (see below), whose sum is σ = 123549877584. Its totient is φ = 102700174720.
The previous prime is 113112123263. The next prime is 113112123317. The reversal of 113112123311 is 113321211311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113112123311 - 210 = 113112122287 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113112123317) 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 7 ways as a sum of consecutive naturals, for example, 6442250 + ... + 6459783.
It is an arithmetic number, because the mean of its divisors is an integer number (15443734698).
Almost surely, 2113112123311 is an apocalyptic number.
113112123311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
113112123311 is a deficient number, since it is larger than the sum of its proper divisors (10437754273).
113112123311 is a wasteful number, since it uses less digits than its factorization.
113112123311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12902841.
The product of its digits is 108, while the sum is 20.
Adding to 113112123311 its reverse (113321211311), we get a palindrome (226433334622).
The spelling of 113112123311 in words is "one hundred thirteen billion, one hundred twelve million, one hundred twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •