Base | Representation |
---|---|
bin | 110011101111101011… |
… | …0100101011110010111 |
3 | 101121211020120010110210 |
4 | 1213133112211132113 |
5 | 3310034041002411 |
6 | 123014245420503 |
7 | 11012456335011 |
oct | 1473726453627 |
9 | 347736503423 |
10 | 111121422231 |
11 | 43143167246 |
12 | 1965240a733 |
13 | a62b93b461 |
14 | 55420db1b1 |
15 | 2d557b0ca6 |
hex | 19df5a5797 |
111121422231 has 8 divisors (see below), whose sum is σ = 151775601264. Its totient is φ = 72274095680.
The previous prime is 111121422229. The next prime is 111121422259. The reversal of 111121422231 is 132224121111.
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 111121422231 - 21 = 111121422229 is a prime.
It is a super-2 number, since 2×1111214222312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111121422198 and 111121422207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111121422211) 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, 451712976 + ... + 451713221.
It is an arithmetic number, because the mean of its divisors is an integer number (18971950158).
Almost surely, 2111121422231 is an apocalyptic number.
111121422231 is a deficient number, since it is larger than the sum of its proper divisors (40654179033).
111121422231 is an equidigital number, since it uses as much as digits as its factorization.
111121422231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 903426241.
The product of its digits is 192, while the sum is 21.
Adding to 111121422231 its reverse (132224121111), we get a palindrome (243345543342).
The spelling of 111121422231 in words is "one hundred eleven billion, one hundred twenty-one million, four hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •