Base | Representation |
---|---|
bin | 10100100111000101… |
… | …11010000010111101 |
3 | 1001120011101022101011 |
4 | 22103202322002331 |
5 | 140130211222442 |
6 | 5030000315221 |
7 | 541131542542 |
oct | 122342720275 |
9 | 31504338334 |
10 | 11065335997 |
11 | 4769103791 |
12 | 2189912b11 |
13 | 10746222c1 |
14 | 76d83abc9 |
15 | 44b698117 |
hex | 2938ba0bd |
11065335997 has 2 divisors, whose sum is σ = 11065335998. Its totient is φ = 11065335996.
The previous prime is 11065335977. The next prime is 11065336027. The reversal of 11065335997 is 79953356011.
11065335997 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10431353956 + 633982041 = 102134^2 + 25179^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11065335997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11065335997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11065335977) 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 as a sum of consecutive naturals, namely, 5532667998 + 5532667999.
It is an arithmetic number, because the mean of its divisors is an integer number (5532667999).
Almost surely, 211065335997 is an apocalyptic number.
It is an amenable number.
11065335997 is a deficient number, since it is larger than the sum of its proper divisors (1).
11065335997 is an equidigital number, since it uses as much as digits as its factorization.
11065335997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 765450, while the sum is 49.
The spelling of 11065335997 in words is "eleven billion, sixty-five million, three hundred thirty-five thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •