Base | Representation |
---|---|
bin | 10101110010111101… |
… | …01011000011110001 |
3 | 1010012111221000022110 |
4 | 22321132223003301 |
5 | 142431122311431 |
6 | 5213053155533 |
7 | 562660215033 |
oct | 127136530361 |
9 | 33174830273 |
10 | 11701760241 |
11 | 4a6537a736 |
12 | 2326a8bba9 |
13 | 1146431cb2 |
14 | 7d0185c53 |
15 | 4874ad346 |
hex | 2b97ab0f1 |
11701760241 has 4 divisors (see below), whose sum is σ = 15602346992. Its totient is φ = 7801173492.
The previous prime is 11701760233. The next prime is 11701760243. The reversal of 11701760241 is 14206710711.
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, and also an emirpimes, since its reverse is a distinct semiprime: 14206710711 = 3 ⋅4735570237.
It is not a de Polignac number, because 11701760241 - 23 = 11701760233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11701760199 and 11701760208.
It is not an unprimeable number, because it can be changed into a prime (11701760243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1950293371 + ... + 1950293376.
It is an arithmetic number, because the mean of its divisors is an integer number (3900586748).
Almost surely, 211701760241 is an apocalyptic number.
It is an amenable number.
11701760241 is a deficient number, since it is larger than the sum of its proper divisors (3900586751).
11701760241 is an equidigital number, since it uses as much as digits as its factorization.
11701760241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3900586750.
The product of its (nonzero) digits is 2352, while the sum is 30.
The spelling of 11701760241 in words is "eleven billion, seven hundred one million, seven hundred sixty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •