Base | Representation |
---|---|
bin | 110011110101100110… |
… | …0100110101011011001 |
3 | 101122100002110122110110 |
4 | 1213223030212223121 |
5 | 3310440423213223 |
6 | 123050104434533 |
7 | 11020421340465 |
oct | 1475314465331 |
9 | 348302418413 |
10 | 111320132313 |
11 | 43235349055 |
12 | 196a8a78a49 |
13 | a660b635a0 |
14 | 55606654a5 |
15 | 2d67e62d93 |
hex | 19eb326ad9 |
111320132313 has 8 divisors (see below), whose sum is σ = 159844292608. Its totient is φ = 68504696784.
The previous prime is 111320132303. The next prime is 111320132333. The reversal of 111320132313 is 313231023111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111320132313 - 25 = 111320132281 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111320132313.
It is not an unprimeable number, because it can be changed into a prime (111320132303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1427181145 + ... + 1427181222.
It is an arithmetic number, because the mean of its divisors is an integer number (19980536576).
Almost surely, 2111320132313 is an apocalyptic number.
111320132313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
111320132313 is a deficient number, since it is larger than the sum of its proper divisors (48524160295).
111320132313 is a wasteful number, since it uses less digits than its factorization.
111320132313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2854362383.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 111320132313 its reverse (313231023111), we get a palindrome (424551155424).
The spelling of 111320132313 in words is "one hundred eleven billion, three hundred twenty million, one hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •