Base | Representation |
---|---|
bin | 1010101001010010001100… |
… | …0000101001000110101001 |
3 | 1112102221000220012022200221 |
4 | 2222110203000221012221 |
5 | 3013231024023040041 |
6 | 40520525334530041 |
7 | 2315420165064235 |
oct | 252244300510651 |
9 | 45387026168627 |
10 | 11704373252521 |
11 | 3802884628994 |
12 | 1390476b06921 |
13 | 66b94391a581 |
14 | 2c66cd5d15c5 |
15 | 1546ce6652d1 |
hex | aa5230291a9 |
11704373252521 has 4 divisors (see below), whose sum is σ = 11704385205072. Its totient is φ = 11704361299972.
The previous prime is 11704373252489. The next prime is 11704373252581. The reversal of 11704373252521 is 12525237340711.
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 a cyclic number.
It is not a de Polignac number, because 11704373252521 - 25 = 11704373252489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11704373252581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4362091 + ... + 6514336.
It is an arithmetic number, because the mean of its divisors is an integer number (2926096301268).
Almost surely, 211704373252521 is an apocalyptic number.
It is an amenable number.
11704373252521 is a deficient number, since it is larger than the sum of its proper divisors (11952551).
11704373252521 is a wasteful number, since it uses less digits than its factorization.
11704373252521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11952550.
The product of its (nonzero) digits is 352800, while the sum is 43.
The spelling of 11704373252521 in words is "eleven trillion, seven hundred four billion, three hundred seventy-three million, two hundred fifty-two thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •