Base | Representation |
---|---|
bin | 110011110011010101… |
… | …0100100011100110111 |
3 | 101122010210101212200212 |
4 | 1213212222210130313 |
5 | 3310311442221211 |
6 | 123034351100035 |
7 | 11015506155221 |
oct | 1474652443467 |
9 | 348123355625 |
10 | 111244101431 |
11 | 431a6438a11 |
12 | 1968751161b |
13 | a64b1929b8 |
14 | 5554513411 |
15 | 2d6144538b |
hex | 19e6aa4737 |
111244101431 has 8 divisors (see below), whose sum is σ = 115068432384. Its totient is φ = 107434508760.
The previous prime is 111244101427. The next prime is 111244101499. The reversal of 111244101431 is 134101442111.
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 111244101431 - 22 = 111244101427 is a prime.
It is a super-2 number, since 2×1112441014312 (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 = 111244101397 and 111244101406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111244101401) 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, 3669215 + ... + 3699408.
It is an arithmetic number, because the mean of its divisors is an integer number (14383554048).
Almost surely, 2111244101431 is an apocalyptic number.
111244101431 is a deficient number, since it is larger than the sum of its proper divisors (3824330953).
111244101431 is an equidigital number, since it uses as much as digits as its factorization.
111244101431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7369141.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 111244101431 its reverse (134101442111), we get a palindrome (245345543542).
The spelling of 111244101431 in words is "one hundred eleven billion, two hundred forty-four million, one hundred one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •