Base | Representation |
---|---|
bin | 1010101001010010000100… |
… | …0011110111111000101011 |
3 | 1112102220221121122121111202 |
4 | 2222110201003313320223 |
5 | 3013230442134420232 |
6 | 40520522205514415 |
7 | 2315416320061232 |
oct | 252244103677053 |
9 | 45386847577452 |
10 | 11704340545067 |
11 | 3802868119335 |
12 | 1390467b72a0b |
13 | 66b939c08151 |
14 | 2c66c9119b19 |
15 | 1546cb854162 |
hex | aa5210f7e2b |
11704340545067 has 4 divisors (see below), whose sum is σ = 11705295779760. Its totient is φ = 11703385310376.
The previous prime is 11704340545063. The next prime is 11704340545069. The reversal of 11704340545067 is 76054504340711.
11704340545067 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11704340545067 - 22 = 11704340545063 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11704340545063) 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, 477598967 + ... + 477623472.
It is an arithmetic number, because the mean of its divisors is an integer number (2926323944940).
Almost surely, 211704340545067 is an apocalyptic number.
11704340545067 is a deficient number, since it is larger than the sum of its proper divisors (955234693).
11704340545067 is an equidigital number, since it uses as much as digits as its factorization.
11704340545067 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 955234692.
The product of its (nonzero) digits is 1411200, while the sum is 47.
Adding to 11704340545067 its reverse (76054504340711), we get a palindrome (87758844885778).
The spelling of 11704340545067 in words is "eleven trillion, seven hundred four billion, three hundred forty million, five hundred forty-five thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •