Base | Representation |
---|---|
bin | 110011110100111111… |
… | …1110100000011011101 |
3 | 101122021200120220212210 |
4 | 1213221333310003131 |
5 | 3310420300031023 |
6 | 123044105151033 |
7 | 11020055256534 |
oct | 1475177640335 |
9 | 348250526783 |
10 | 111300002013 |
11 | 43224a49942 |
12 | 196a218b479 |
13 | a659935a75 |
14 | 555bb0531b |
15 | 2d662d8593 |
hex | 19e9ff40dd |
111300002013 has 8 divisors (see below), whose sum is σ = 148419722368. Its totient is φ = 74190141504.
The previous prime is 111300001993. The next prime is 111300002027. The reversal of 111300002013 is 310200003111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111300002013 - 230 = 110226260189 is a prime.
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 111300002013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111300002083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2438581 + ... + 2483802.
It is an arithmetic number, because the mean of its divisors is an integer number (18552465296).
Almost surely, 2111300002013 is an apocalyptic number.
It is an amenable number.
111300002013 is a deficient number, since it is larger than the sum of its proper divisors (37119720355).
111300002013 is an equidigital number, since it uses as much as digits as its factorization.
111300002013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4929923.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 111300002013 its reverse (310200003111), we get a palindrome (421500005124).
The spelling of 111300002013 in words is "one hundred eleven billion, three hundred million, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.653 sec. • engine limits •