Base | Representation |
---|---|
bin | 10100111100000100… |
… | …10000100101100101 |
3 | 1002000102112120120120 |
4 | 22132002100211211 |
5 | 141010234430244 |
6 | 5055244352153 |
7 | 545366462646 |
oct | 123602204545 |
9 | 32012476516 |
10 | 11241326949 |
11 | 4849488356 |
12 | 2218845659 |
13 | 10a1c21468 |
14 | 788d6d6cd |
15 | 45bd5d819 |
hex | 29e090965 |
11241326949 has 4 divisors (see below), whose sum is σ = 14988435936. Its totient is φ = 7494217964.
The previous prime is 11241326947. The next prime is 11241326951. The reversal of 11241326949 is 94962314211.
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 an interprime number because it is at equal distance from previous prime (11241326947) and next prime (11241326951).
It is a cyclic number.
It is not a de Polignac number, because 11241326949 - 21 = 11241326947 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11241326949.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11241326947) 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, 1873554489 + ... + 1873554494.
It is an arithmetic number, because the mean of its divisors is an integer number (3747108984).
Almost surely, 211241326949 is an apocalyptic number.
It is an amenable number.
11241326949 is a deficient number, since it is larger than the sum of its proper divisors (3747108987).
11241326949 is an equidigital number, since it uses as much as digits as its factorization.
11241326949 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3747108986.
The product of its digits is 93312, while the sum is 42.
The spelling of 11241326949 in words is "eleven billion, two hundred forty-one million, three hundred twenty-six thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •