Base | Representation |
---|---|
bin | 11001010010110100001111… |
… | …000001101101101000110011 |
3 | 112120212211201120102121201111 |
4 | 121102310033001231220303 |
5 | 104040111110202303021 |
6 | 1032332514024414151 |
7 | 32301061660415122 |
oct | 3122641701555063 |
9 | 476784646377644 |
10 | 111244200041011 |
11 | 3249a44487a2a4 |
12 | 10587a55617357 |
13 | 4a0c38ab2cc8b |
14 | 1d6836877dab9 |
15 | ccdab49c18e1 |
hex | 652d0f06da33 |
111244200041011 has 8 divisors (see below), whose sum is σ = 113618344734720. Its totient is φ = 108870357298248.
The previous prime is 111244200040973. The next prime is 111244200041027. The reversal of 111244200041011 is 110140002442111.
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 111244200041011 - 211 = 111244200038963 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111244200041071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74742961 + ... + 76216786.
It is an arithmetic number, because the mean of its divisors is an integer number (14202293091840).
Almost surely, 2111244200041011 is an apocalyptic number.
111244200041011 is a deficient number, since it is larger than the sum of its proper divisors (2374144693709).
111244200041011 is a wasteful number, since it uses less digits than its factorization.
111244200041011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150975473.
The product of its (nonzero) digits is 256, while the sum is 22.
Adding to 111244200041011 its reverse (110140002442111), we get a palindrome (221384202483122).
The spelling of 111244200041011 in words is "one hundred eleven trillion, two hundred forty-four billion, two hundred million, forty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •