Base | Representation |
---|---|
bin | 10100100111110100… |
… | …00001011100110011 |
3 | 1001120120210011122012 |
4 | 22103322001130303 |
5 | 140133234130020 |
6 | 5030334233135 |
7 | 541234211246 |
oct | 122372013463 |
9 | 31516704565 |
10 | 11071395635 |
11 | 4771572453 |
12 | 218b9557ab |
13 | 10759644a1 |
14 | 77057725d |
15 | 44be937c5 |
hex | 293e81733 |
11071395635 has 4 divisors (see below), whose sum is σ = 13285674768. Its totient is φ = 8857116504.
The previous prime is 11071395557. The next prime is 11071395677. The reversal of 11071395635 is 53659317011.
11071395635 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11071395635 - 226 = 11004286771 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11071395592 and 11071395601.
It is an unprimeable number.
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, 1107139559 + ... + 1107139568.
It is an arithmetic number, because the mean of its divisors is an integer number (3321418692).
Almost surely, 211071395635 is an apocalyptic number.
11071395635 is a deficient number, since it is larger than the sum of its proper divisors (2214279133).
11071395635 is an equidigital number, since it uses as much as digits as its factorization.
11071395635 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2214279132.
The product of its (nonzero) digits is 85050, while the sum is 41.
The spelling of 11071395635 in words is "eleven billion, seventy-one million, three hundred ninety-five thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •