Base | Representation |
---|---|
bin | 10101001000010001… |
… | …00010100011011001 |
3 | 1002021120001110011111 |
4 | 22210020202203121 |
5 | 141212432333242 |
6 | 5113341300321 |
7 | 551051215051 |
oct | 124410424331 |
9 | 32246043144 |
10 | 11343636697 |
11 | 48a1207168 |
12 | 2246b646a1 |
13 | 10ba193383 |
14 | 7987a2561 |
15 | 465d1c817 |
hex | 2a42228d9 |
11343636697 has 2 divisors, whose sum is σ = 11343636698. Its totient is φ = 11343636696.
The previous prime is 11343636613. The next prime is 11343636719. The reversal of 11343636697 is 79663634311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6513942681 + 4829694016 = 80709^2 + 69496^2 .
It is a cyclic number.
It is not a de Polignac number, because 11343636697 - 27 = 11343636569 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11343636697.
It is not a weakly prime, because it can be changed into another prime (11343676697) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5671818348 + 5671818349.
It is an arithmetic number, because the mean of its divisors is an integer number (5671818349).
Almost surely, 211343636697 is an apocalyptic number.
It is an amenable number.
11343636697 is a deficient number, since it is larger than the sum of its proper divisors (1).
11343636697 is an equidigital number, since it uses as much as digits as its factorization.
11343636697 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1469664, while the sum is 49.
The spelling of 11343636697 in words is "eleven billion, three hundred forty-three million, six hundred thirty-six thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •