Base | Representation |
---|---|
bin | 110011101111010101… |
… | …1000100000001100111 |
3 | 101121210110002110222211 |
4 | 1213132223010001213 |
5 | 3310023130404111 |
6 | 123013201104251 |
7 | 11012260346023 |
oct | 1473653040147 |
9 | 347713073884 |
10 | 111110013031 |
11 | 43137784356 |
12 | 1964a628087 |
13 | a629475354 |
14 | 55407ab383 |
15 | 2d547aa521 |
hex | 19deac4067 |
111110013031 has 4 divisors (see below), whose sum is σ = 112674942864. Its totient is φ = 109545083200.
The previous prime is 111110012983. The next prime is 111110013067. The reversal of 111110013031 is 130310011111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 111110013031 - 27 = 111110012903 is a prime.
It is a super-2 number, since 2×1111100130312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111110013731) 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 3 ways as a sum of consecutive naturals, for example, 782464810 + ... + 782464951.
It is an arithmetic number, because the mean of its divisors is an integer number (28168735716).
Almost surely, 2111110013031 is an apocalyptic number.
111110013031 is a deficient number, since it is larger than the sum of its proper divisors (1564929833).
111110013031 is an equidigital number, since it uses as much as digits as its factorization.
111110013031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1564929832.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 111110013031 its reverse (130310011111), we get a palindrome (241420024142).
The spelling of 111110013031 in words is "one hundred eleven billion, one hundred ten million, thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •