Base | Representation |
---|---|
bin | 1010010011110000111100… |
… | …0000110011101111110001 |
3 | 1111010120202200100212012222 |
4 | 2210330033000303233301 |
5 | 2441201401131024322 |
6 | 40035024211130425 |
7 | 2246621463064331 |
oct | 244741700635761 |
9 | 44116680325188 |
10 | 11334670564337 |
11 | 368000904836a |
12 | 133089a2a3a15 |
13 | 642b16140693 |
14 | 2b285b14b0c1 |
15 | 149c92a22e42 |
hex | a4f0f033bf1 |
11334670564337 has 2 divisors, whose sum is σ = 11334670564338. Its totient is φ = 11334670564336.
The previous prime is 11334670564313. The next prime is 11334670564339. The reversal of 11334670564337 is 73346507643311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10322572191376 + 1012098372961 = 3212876^2 + 1006031^2 .
It is a cyclic number.
It is not a de Polignac number, because 11334670564337 - 28 = 11334670564081 is a prime.
Together with 11334670564339, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (11334670564339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5667335282168 + 5667335282169.
It is an arithmetic number, because the mean of its divisors is an integer number (5667335282169).
Almost surely, 211334670564337 is an apocalyptic number.
It is an amenable number.
11334670564337 is a deficient number, since it is larger than the sum of its proper divisors (1).
11334670564337 is an equidigital number, since it uses as much as digits as its factorization.
11334670564337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11430720, while the sum is 53.
The spelling of 11334670564337 in words is "eleven trillion, three hundred thirty-four billion, six hundred seventy million, five hundred sixty-four thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •