Base | Representation |
---|---|
bin | 10100110111110010… |
… | …01111111101110001 |
3 | 1001220220221211201010 |
4 | 22123321033331301 |
5 | 140422041120143 |
6 | 5051522501133 |
7 | 544452263532 |
oct | 123371177561 |
9 | 31826854633 |
10 | 11205410673 |
11 | 4830186986 |
12 | 22088047a9 |
13 | 1097657622 |
14 | 7842a0689 |
15 | 458b16a33 |
hex | 29be4ff71 |
11205410673 has 4 divisors (see below), whose sum is σ = 14940547568. Its totient is φ = 7470273780.
The previous prime is 11205410647. The next prime is 11205410737. The reversal of 11205410673 is 37601450211.
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 not a de Polignac number, because 11205410673 - 212 = 11205406577 is a prime.
It is a super-2 number, since 2×112054106732 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11205410673.
It is not an unprimeable number, because it can be changed into a prime (11205410173) 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, 1867568443 + ... + 1867568448.
It is an arithmetic number, because the mean of its divisors is an integer number (3735136892).
Almost surely, 211205410673 is an apocalyptic number.
It is an amenable number.
11205410673 is a deficient number, since it is larger than the sum of its proper divisors (3735136895).
11205410673 is an equidigital number, since it uses as much as digits as its factorization.
11205410673 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3735136894.
The product of its (nonzero) digits is 5040, while the sum is 30.
Adding to 11205410673 its reverse (37601450211), we get a palindrome (48806860884).
The spelling of 11205410673 in words is "eleven billion, two hundred five million, four hundred ten thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •