Base | Representation |
---|---|
bin | 110000100001110010… |
… | …1000101101010100111 |
3 | 100221222210011111000021 |
4 | 1201003211011222213 |
5 | 3201412012323421 |
6 | 115512542300011 |
7 | 10346331656506 |
oct | 1410345055247 |
9 | 327883144007 |
10 | 104213011111 |
11 | 40218589770 |
12 | 18244887607 |
13 | 9a9a5c2721 |
14 | 50887c283d |
15 | 2a9e039341 |
hex | 1843945aa7 |
104213011111 has 4 divisors (see below), whose sum is σ = 113686921224. Its totient is φ = 94739101000.
The previous prime is 104213011087. The next prime is 104213011117. The reversal of 104213011111 is 111110312401.
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 104213011111 - 217 = 104212880039 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 (104213011117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4736955040 + ... + 4736955061.
It is an arithmetic number, because the mean of its divisors is an integer number (28421730306).
Almost surely, 2104213011111 is an apocalyptic number.
104213011111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
104213011111 is a deficient number, since it is larger than the sum of its proper divisors (9473910113).
104213011111 is an equidigital number, since it uses as much as digits as its factorization.
104213011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9473910112.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 104213011111 its reverse (111110312401), we get a palindrome (215323323512).
The spelling of 104213011111 in words is "one hundred four billion, two hundred thirteen million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •