Base | Representation |
---|---|
bin | 11001010001010101111111… |
… | …000010010001010110110011 |
3 | 112120112011111202201220200002 |
4 | 121101111333002101112303 |
5 | 104031431331001123103 |
6 | 1032214220033020215 |
7 | 32260550102424221 |
oct | 3121257702212663 |
9 | 476464452656602 |
10 | 111143000020403 |
11 | 32460533023a2a |
12 | 105703119b466b |
13 | 4a0298081c890 |
14 | 1d634c81c5b11 |
15 | ccb140245488 |
hex | 65157f0915b3 |
111143000020403 has 8 divisors (see below), whose sum is σ = 120134131164096. Its totient is φ = 102214964534400.
The previous prime is 111143000020369. The next prime is 111143000020439. The reversal of 111143000020403 is 304020000341111.
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 111143000020403 - 214 = 111143000004019 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111143000020303) 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, 15773910758 + ... + 15773917803.
It is an arithmetic number, because the mean of its divisors is an integer number (15016766395512).
Almost surely, 2111143000020403 is an apocalyptic number.
111143000020403 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
111143000020403 is a deficient number, since it is larger than the sum of its proper divisors (8991131143693).
111143000020403 is a wasteful number, since it uses less digits than its factorization.
111143000020403 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31547828845.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 111143000020403 its reverse (304020000341111), we get a palindrome (415163000361514).
The spelling of 111143000020403 in words is "one hundred eleven trillion, one hundred forty-three billion, twenty thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •