Base | Representation |
---|---|
bin | 11001001000111110… |
… | …10101011011011001 |
3 | 1021211122011111211122 |
4 | 30210133111123121 |
5 | 210120224032042 |
6 | 10111145335025 |
7 | 655320264545 |
oct | 144437253331 |
9 | 37748144748 |
10 | 13497095897 |
11 | 57a6838a0a |
12 | 2748197475 |
13 | 137137ac9c |
14 | 9207a6a25 |
15 | 53ede47d2 |
hex | 3247d56d9 |
13497095897 has 2 divisors, whose sum is σ = 13497095898. Its totient is φ = 13497095896.
The previous prime is 13497095861. The next prime is 13497095903. The reversal of 13497095897 is 79859079431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13174677961 + 322417936 = 114781^2 + 17956^2 .
It is a cyclic number.
It is not a de Polignac number, because 13497095897 - 224 = 13480318681 is a prime.
It is not a weakly prime, because it can be changed into another prime (13497095837) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6748547948 + 6748547949.
It is an arithmetic number, because the mean of its divisors is an integer number (6748547949).
Almost surely, 213497095897 is an apocalyptic number.
It is an amenable number.
13497095897 is a deficient number, since it is larger than the sum of its proper divisors (1).
13497095897 is an equidigital number, since it uses as much as digits as its factorization.
13497095897 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17146080, while the sum is 62.
The spelling of 13497095897 in words is "thirteen billion, four hundred ninety-seven million, ninety-five thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.001 sec. • engine limits •