Base | Representation |
---|---|
bin | 110011101111011001… |
… | …1011010011100011101 |
3 | 101121210121012200201020 |
4 | 1213132303122130131 |
5 | 3310024210431023 |
6 | 123013320034353 |
7 | 11012315063631 |
oct | 1473663323435 |
9 | 347717180636 |
10 | 111112202013 |
11 | 43138a39a2a |
12 | 1964b3029b9 |
13 | a629a607c7 |
14 | 5540bbadc1 |
15 | 2d54a8dde3 |
hex | 19decda71d |
111112202013 has 8 divisors (see below), whose sum is σ = 149058496608. Its totient is φ = 73620354384.
The previous prime is 111112201979. The next prime is 111112202039. The reversal of 111112202013 is 310202211111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111112202013 - 213 = 111112193821 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 111112201983 and 111112202001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111112272013) 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, 113611170 + ... + 113612147.
It is an arithmetic number, because the mean of its divisors is an integer number (18632312076).
Almost surely, 2111112202013 is an apocalyptic number.
It is an amenable number.
111112202013 is a deficient number, since it is larger than the sum of its proper divisors (37946294595).
111112202013 is a wasteful number, since it uses less digits than its factorization.
111112202013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227223483.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 111112202013 its reverse (310202211111), we get a palindrome (421314413124).
The spelling of 111112202013 in words is "one hundred eleven billion, one hundred twelve million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •