Base | Representation |
---|---|
bin | 110011101100111100… |
… | …1110110000110110111 |
3 | 101121120212112111122010 |
4 | 1213121321312012313 |
5 | 3304342140031403 |
6 | 123001222135303 |
7 | 11010266306016 |
oct | 1473171660667 |
9 | 347525474563 |
10 | 111030002103 |
11 | 430a65a5a19 |
12 | 19627881533 |
13 | a615a0ccc7 |
14 | 5533d00a7d |
15 | 2d4c753603 |
hex | 19d9e761b7 |
111030002103 has 4 divisors (see below), whose sum is σ = 148040002808. Its totient is φ = 74020001400.
The previous prime is 111030002093. The next prime is 111030002107. The reversal of 111030002103 is 301200030111.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 111030002103 - 28 = 111030001847 is a prime.
It is a super-3 number, since 3×1110300021033 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111030002107) 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, 18505000348 + ... + 18505000353.
It is an arithmetic number, because the mean of its divisors is an integer number (37010000702).
Almost surely, 2111030002103 is an apocalyptic number.
111030002103 is a deficient number, since it is larger than the sum of its proper divisors (37010000705).
111030002103 is an equidigital number, since it uses as much as digits as its factorization.
111030002103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37010000704.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 111030002103 its reverse (301200030111), we get a palindrome (412230032214).
The spelling of 111030002103 in words is "one hundred eleven billion, thirty million, two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •