Base | Representation |
---|---|
bin | 11001001111011100000100… |
… | …110010010100100111001011 |
3 | 112120001122122010020220102210 |
4 | 121033130010302110213023 |
5 | 104022310240100001303 |
6 | 1032034131003200203 |
7 | 32245234216545243 |
oct | 3117340462244713 |
9 | 476048563226383 |
10 | 111012100000203 |
11 | 3240aa70409356 |
12 | 1054aa7b816063 |
13 | 49c351c34541c |
14 | 1d5b02b396b23 |
15 | cc7a2d39e203 |
hex | 64f704c949cb |
111012100000203 has 4 divisors (see below), whose sum is σ = 148016133333608. Its totient is φ = 74008066666800.
The previous prime is 111012100000181. The next prime is 111012100000211. The reversal of 111012100000203 is 302000001210111.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 111012100000203 - 25 = 111012100000171 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111012100000003) 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 3 ways as a sum of consecutive naturals, for example, 18502016666698 + ... + 18502016666703.
It is an arithmetic number, because the mean of its divisors is an integer number (37004033333402).
Almost surely, 2111012100000203 is an apocalyptic number.
111012100000203 is a deficient number, since it is larger than the sum of its proper divisors (37004033333405).
111012100000203 is an equidigital number, since it uses as much as digits as its factorization.
111012100000203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37004033333404.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 111012100000203 its reverse (302000001210111), we get a palindrome (413012101210314).
The spelling of 111012100000203 in words is "one hundred eleven trillion, twelve billion, one hundred million, two hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •