Base | Representation |
---|---|
bin | 110011110011000000… |
… | …0010011000011101101 |
3 | 101122010000112220000201 |
4 | 1213212000103003231 |
5 | 3310301123121031 |
6 | 123033313353501 |
7 | 11015313033235 |
oct | 1474600230355 |
9 | 348100486021 |
10 | 111233020141 |
11 | 431a015a421 |
12 | 19683868891 |
13 | a648ab2c19 |
14 | 5552c6acc5 |
15 | 2d604a6d61 |
hex | 19e60130ed |
111233020141 has 8 divisors (see below), whose sum is σ = 118538797824. Its totient is φ = 104133039120.
The previous prime is 111233020123. The next prime is 111233020147. The reversal of 111233020141 is 141020332111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111233020141 - 211 = 111233018093 is a prime.
It is a super-2 number, since 2×1112330201412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111233020147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51448050 + ... + 51450211.
It is an arithmetic number, because the mean of its divisors is an integer number (14817349728).
Almost surely, 2111233020141 is an apocalyptic number.
It is an amenable number.
111233020141 is a deficient number, since it is larger than the sum of its proper divisors (7305777683).
111233020141 is a wasteful number, since it uses less digits than its factorization.
111233020141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102898331.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 111233020141 its reverse (141020332111), we get a palindrome (252253352252).
The spelling of 111233020141 in words is "one hundred eleven billion, two hundred thirty-three million, twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •