Base | Representation |
---|---|
bin | 10101111001000101… |
… | …11010100111111101 |
3 | 1010100002201122012001 |
4 | 22330202322213331 |
5 | 143032310013341 |
6 | 5222131542301 |
7 | 564153405343 |
oct | 127442724775 |
9 | 33302648161 |
10 | 11753204221 |
11 | 4a91417320 |
12 | 234015a991 |
13 | 1153ca4715 |
14 | 7d6d37993 |
15 | 48bc70d31 |
hex | 2bc8ba9fd |
11753204221 has 8 divisors (see below), whose sum is σ = 12869344800. Its totient is φ = 10645008240.
The previous prime is 11753204191. The next prime is 11753204227. The reversal of 11753204221 is 12240235711.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11753204221 - 217 = 11753073149 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 11753204221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11753204227) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1983051 + ... + 1988968.
It is an arithmetic number, because the mean of its divisors is an integer number (1608668100).
Almost surely, 211753204221 is an apocalyptic number.
11753204221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11753204221 is a deficient number, since it is larger than the sum of its proper divisors (1116140579).
11753204221 is a wasteful number, since it uses less digits than its factorization.
11753204221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3972299.
The product of its (nonzero) digits is 3360, while the sum is 28.
Adding to 11753204221 its reverse (12240235711), we get a palindrome (23993439932).
The spelling of 11753204221 in words is "eleven billion, seven hundred fifty-three million, two hundred four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •