Base | Representation |
---|---|
bin | 110011110101000011… |
… | …1011100011010001001 |
3 | 101122021211100112202222 |
4 | 1213222013130122021 |
5 | 3310421303033223 |
6 | 123044220103425 |
7 | 11020111260365 |
oct | 1475207343211 |
9 | 348254315688 |
10 | 111302002313 |
11 | 43226095787 |
12 | 196a2994b75 |
13 | a65a186388 |
14 | 555c0a62a5 |
15 | 2d665810c8 |
hex | 19ea1dc689 |
111302002313 has 8 divisors (see below), whose sum is σ = 112327864320. Its totient is φ = 110278476000.
The previous prime is 111302002277. The next prime is 111302002381. The reversal of 111302002313 is 313200203111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111302002313 - 26 = 111302002249 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111302002291 and 111302002300.
It is not an unprimeable number, because it can be changed into a prime (111322002313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 488108 + ... + 678861.
It is an arithmetic number, because the mean of its divisors is an integer number (14040983040).
Almost surely, 2111302002313 is an apocalyptic number.
It is an amenable number.
111302002313 is a deficient number, since it is larger than the sum of its proper divisors (1025862007).
111302002313 is a wasteful number, since it uses less digits than its factorization.
111302002313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1167847.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 111302002313 its reverse (313200203111), we get a palindrome (424502205424).
The spelling of 111302002313 in words is "one hundred eleven billion, three hundred two million, two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •