Base | Representation |
---|---|
bin | 11001001111011100000000… |
… | …100111010111111001010011 |
3 | 112120001122110020120121021222 |
4 | 121033130000213113321103 |
5 | 104022310114141134303 |
6 | 1032034120023235255 |
7 | 32245232406666653 |
oct | 3117340047277123 |
9 | 476048406517258 |
10 | 111012030021203 |
11 | 3240aa34962073 |
12 | 1054aa602a8b2b |
13 | 49c350a9b332c |
14 | 1d5b021d7c363 |
15 | cc7a27179938 |
hex | 64f7009d7e53 |
111012030021203 has 4 divisors (see below), whose sum is σ = 111016823516880. Its totient is φ = 111007236525528.
The previous prime is 111012030021133. The next prime is 111012030021247. The reversal of 111012030021203 is 302120030210111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 111012030021203 - 216 = 111012029955667 is a prime.
It is a super-2 number, since 2×1110120300212032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111012030021103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2396713100 + ... + 2396759417.
It is an arithmetic number, because the mean of its divisors is an integer number (27754205879220).
Almost surely, 2111012030021203 is an apocalyptic number.
111012030021203 is a deficient number, since it is larger than the sum of its proper divisors (4793495677).
111012030021203 is an equidigital number, since it uses as much as digits as its factorization.
111012030021203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4793495676.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 111012030021203 its reverse (302120030210111), we get a palindrome (413132060231314).
The spelling of 111012030021203 in words is "one hundred eleven trillion, twelve billion, thirty million, twenty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •