Base | Representation |
---|---|
bin | 10101000110010001… |
… | …11000100110001101 |
3 | 1002020101122200000021 |
4 | 22203020320212031 |
5 | 141144144343043 |
6 | 5111543502141 |
7 | 550456325116 |
oct | 124310704615 |
9 | 32211580007 |
10 | 11326949773 |
11 | 489284a017 |
12 | 2241457951 |
13 | 10b689cc59 |
14 | 79649b20d |
15 | 4646233ed |
hex | 2a323898d |
11326949773 has 4 divisors (see below), whose sum is σ = 11389529788. Its totient is φ = 11264369760.
The previous prime is 11326949687. The next prime is 11326949783. The reversal of 11326949773 is 37794962311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4615571844 + 6711377929 = 67938^2 + 81923^2 .
It is a cyclic number.
It is not a de Polignac number, because 11326949773 - 221 = 11324852621 is a prime.
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 11326949773.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11326949783) 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, 31289736 + ... + 31290097.
It is an arithmetic number, because the mean of its divisors is an integer number (2847382447).
Almost surely, 211326949773 is an apocalyptic number.
It is an amenable number.
11326949773 is a deficient number, since it is larger than the sum of its proper divisors (62580015).
11326949773 is an equidigital number, since it uses as much as digits as its factorization.
11326949773 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62580014.
The product of its digits is 1714608, while the sum is 52.
The spelling of 11326949773 in words is "eleven billion, three hundred twenty-six million, nine hundred forty-nine thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •