Base | Representation |
---|---|
bin | 110011111001101001… |
… | …1011001010001011101 |
3 | 101122200120101001102001 |
4 | 1213303103121101131 |
5 | 3311230232131031 |
6 | 123111403402301 |
7 | 11023662321556 |
oct | 1476323312135 |
9 | 348616331361 |
10 | 111456130141 |
11 | 432a5097254 |
12 | 19726523391 |
13 | a68309c085 |
14 | 557474732d |
15 | 2d74d78861 |
hex | 19f34d945d |
111456130141 has 8 divisors (see below), whose sum is σ = 113824380600. Its totient is φ = 109112678400.
The previous prime is 111456130127. The next prime is 111456130151. The reversal of 111456130141 is 141031654111.
It can be written as a sum of positive squares in 4 ways, for example, as 61806932100 + 49649198041 = 248610^2 + 222821^2 .
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 111456130141 - 213 = 111456121949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111456130151) 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, 6190596 + ... + 6208573.
It is an arithmetic number, because the mean of its divisors is an integer number (14228047575).
Almost surely, 2111456130141 is an apocalyptic number.
It is an amenable number.
111456130141 is a deficient number, since it is larger than the sum of its proper divisors (2368250459).
111456130141 is a wasteful number, since it uses less digits than its factorization.
111456130141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12399359.
The product of its (nonzero) digits is 1440, while the sum is 28.
Adding to 111456130141 its reverse (141031654111), we get a palindrome (252487784252).
The spelling of 111456130141 in words is "one hundred eleven billion, four hundred fifty-six million, one hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •