Base | Representation |
---|---|
bin | 110011101111000110… |
… | …0011111101110001101 |
3 | 101121202220000101012101 |
4 | 1213132030133232031 |
5 | 3310014103000023 |
6 | 123012313235101 |
7 | 11012132263324 |
oct | 1473614375615 |
9 | 347686011171 |
10 | 111102000013 |
11 | 43133201024 |
12 | 19647a02a91 |
13 | a6278cb014 |
14 | 553d6c30bb |
15 | 2d53c261ad |
hex | 19de31fb8d |
111102000013 has 4 divisors (see below), whose sum is σ = 111103571488. Its totient is φ = 111100428540.
The previous prime is 111102000001. The next prime is 111102000029. The reversal of 111102000013 is 310000201111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111102000013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111102003013) 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, 674433 + ... + 822838.
It is an arithmetic number, because the mean of its divisors is an integer number (27775892872).
Almost surely, 2111102000013 is an apocalyptic number.
It is an amenable number.
111102000013 is a deficient number, since it is larger than the sum of its proper divisors (1571475).
111102000013 is an equidigital number, since it uses as much as digits as its factorization.
111102000013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1571474.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 111102000013 its reverse (310000201111), we get a palindrome (421102201124).
The spelling of 111102000013 in words is "one hundred eleven billion, one hundred two million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •