Base | Representation |
---|---|
bin | 110011101111101010… |
… | …1101111111101010111 |
3 | 101121211020010222210021 |
4 | 1213133111233331113 |
5 | 3310034011444111 |
6 | 123014241010011 |
7 | 11012454432646 |
oct | 1473725577527 |
9 | 347736128707 |
10 | 111121203031 |
11 | 43143027593 |
12 | 19652323907 |
13 | a62b892757 |
14 | 554208135d |
15 | 2d5576ad71 |
hex | 19df56ff57 |
111121203031 has 8 divisors (see below), whose sum is σ = 112229987184. Its totient is φ = 110012587200.
The previous prime is 111121203029. The next prime is 111121203077. The reversal of 111121203031 is 130302121111.
It is a happy number.
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 111121203031 - 21 = 111121203029 is a prime.
It is a super-2 number, since 2×1111212030312 (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 = 111121202996 and 111121203014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111121203731) 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, 1603996 + ... + 1671838.
It is an arithmetic number, because the mean of its divisors is an integer number (14028748398).
Almost surely, 2111121203031 is an apocalyptic number.
111121203031 is a deficient number, since it is larger than the sum of its proper divisors (1108784153).
111121203031 is a wasteful number, since it uses less digits than its factorization.
111121203031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84161.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 111121203031 its reverse (130302121111), we get a palindrome (241423324142).
The spelling of 111121203031 in words is "one hundred eleven billion, one hundred twenty-one million, two hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •