Base | Representation |
---|---|
bin | 11001011100011101… |
… | …01101110001000001 |
3 | 1022021000122212121212 |
4 | 30232032231301001 |
5 | 210434042330142 |
6 | 10135304055505 |
7 | 662343300356 |
oct | 145616556101 |
9 | 38230585555 |
10 | 13660511297 |
11 | 5880003364 |
12 | 2792a64595 |
13 | 13991961a4 |
14 | 93838462d |
15 | 54e423d82 |
hex | 32e3adc41 |
13660511297 has 2 divisors, whose sum is σ = 13660511298. Its totient is φ = 13660511296.
The previous prime is 13660511281. The next prime is 13660511321. The reversal of 13660511297 is 79211506631.
13660511297 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., 13287403441 + 373107856 = 115271^2 + 19316^2 .
It is a cyclic number.
It is not a de Polignac number, because 13660511297 - 24 = 13660511281 is a prime.
It is not a weakly prime, because it can be changed into another prime (13660511797) 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, 6830255648 + 6830255649.
It is an arithmetic number, because the mean of its divisors is an integer number (6830255649).
Almost surely, 213660511297 is an apocalyptic number.
It is an amenable number.
13660511297 is a deficient number, since it is larger than the sum of its proper divisors (1).
13660511297 is an equidigital number, since it uses as much as digits as its factorization.
13660511297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 41.
The spelling of 13660511297 in words is "thirteen billion, six hundred sixty million, five hundred eleven thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •