Base | Representation |
---|---|
bin | 10100100000100000… |
… | …01111011000110101 |
3 | 1001102022110120221222 |
4 | 22100100033120311 |
5 | 140022042023104 |
6 | 5020304520125 |
7 | 536561254031 |
oct | 122020173065 |
9 | 31368416858 |
10 | 11010111029 |
11 | 473aa14415 |
12 | 2173320045 |
13 | 10660578c8 |
14 | 7663831c1 |
15 | 4468da1be |
hex | 29040f635 |
11010111029 has 4 divisors (see below), whose sum is σ = 11389770060. Its totient is φ = 10630452000.
The previous prime is 11010111023. The next prime is 11010111061. The reversal of 11010111029 is 92011101011.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 92011101011 = 136649 ⋅673339.
It can be written as a sum of positive squares in 2 ways, for example, as 5413574929 + 5596536100 = 73577^2 + 74810^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11010111029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11010110998 and 11010111016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010111023) 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, 189829472 + ... + 189829529.
It is an arithmetic number, because the mean of its divisors is an integer number (2847442515).
Almost surely, 211010111029 is an apocalyptic number.
It is an amenable number.
11010111029 is a deficient number, since it is larger than the sum of its proper divisors (379659031).
11010111029 is an equidigital number, since it uses as much as digits as its factorization.
11010111029 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 379659030.
The product of its (nonzero) digits is 18, while the sum is 17.
The spelling of 11010111029 in words is "eleven billion, ten million, one hundred eleven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •