Base | Representation |
---|---|
bin | 110011110011011000… |
… | …0001000100011011111 |
3 | 101122010220010222112002 |
4 | 1213212300020203133 |
5 | 3310312330410111 |
6 | 123034442232515 |
7 | 11015524441544 |
oct | 1474660104337 |
9 | 348126128462 |
10 | 111245560031 |
11 | 431a7244871 |
12 | 19687ab573b |
13 | a64b583888 |
14 | 55547b2bcb |
15 | 2d6163263b |
hex | 19e6c088df |
111245560031 has 8 divisors (see below), whose sum is σ = 112920723840. Its totient is φ = 109570831128.
The previous prime is 111245560003. The next prime is 111245560033. The reversal of 111245560031 is 130065542111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111245560031 is a prime.
It is a super-2 number, since 2×1112455600312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111245559976 and 111245560003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111245560033) 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, 426380 + ... + 635838.
It is an arithmetic number, because the mean of its divisors is an integer number (14115090480).
Almost surely, 2111245560031 is an apocalyptic number.
111245560031 is a deficient number, since it is larger than the sum of its proper divisors (1675163809).
111245560031 is an equidigital number, since it uses as much as digits as its factorization.
111245560031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217453.
The product of its (nonzero) digits is 3600, while the sum is 29.
The spelling of 111245560031 in words is "one hundred eleven billion, two hundred forty-five million, five hundred sixty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •