Base | Representation |
---|---|
bin | 110011111001001110… |
… | …1111000000010111101 |
3 | 101122122120222021020111 |
4 | 1213302131320002331 |
5 | 3311213134203123 |
6 | 123110142550021 |
7 | 11023432136560 |
oct | 1476235700275 |
9 | 348576867214 |
10 | 111442100413 |
11 | 43298184536 |
12 | 19721898311 |
13 | a6801c9267 |
14 | 55729344d7 |
15 | 2d73a0690d |
hex | 19f27780bd |
111442100413 has 4 divisors (see below), whose sum is σ = 127362400480. Its totient is φ = 95521800348.
The previous prime is 111442100389. The next prime is 111442100431. The reversal of 111442100413 is 314001244111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111442100413 is a prime.
It is a super-2 number, since 2×1114421004132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111442100453) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7960150023 + ... + 7960150036.
It is an arithmetic number, because the mean of its divisors is an integer number (31840600120).
Almost surely, 2111442100413 is an apocalyptic number.
It is an amenable number.
111442100413 is a deficient number, since it is larger than the sum of its proper divisors (15920300067).
111442100413 is an equidigital number, since it uses as much as digits as its factorization.
111442100413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15920300066.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 111442100413 its reverse (314001244111), we get a palindrome (425443344524).
The spelling of 111442100413 in words is "one hundred eleven billion, four hundred forty-two million, one hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •