Base | Representation |
---|---|
bin | 101000110111100… |
… | …1101011010010101 |
3 | 10112120101210101022 |
4 | 1101233031122111 |
5 | 10302030031242 |
6 | 344024210525 |
7 | 45661054136 |
oct | 12157153225 |
9 | 3476353338 |
10 | 1371330197 |
11 | 644097746 |
12 | 323309a45 |
13 | 18b1510b3 |
14 | d01abc8d |
15 | 805d00d2 |
hex | 51bcd695 |
1371330197 has 2 divisors, whose sum is σ = 1371330198. Its totient is φ = 1371330196.
The previous prime is 1371330179. The next prime is 1371330251. The reversal of 1371330197 is 7910331731.
Together with previous prime (1371330179) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1310005636 + 61324561 = 36194^2 + 7831^2 .
It is a cyclic number.
It is not a de Polignac number, because 1371330197 - 28 = 1371329941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1371330497) 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, 685665098 + 685665099.
It is an arithmetic number, because the mean of its divisors is an integer number (685665099).
Almost surely, 21371330197 is an apocalyptic number.
It is an amenable number.
1371330197 is a deficient number, since it is larger than the sum of its proper divisors (1).
1371330197 is an equidigital number, since it uses as much as digits as its factorization.
1371330197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11907, while the sum is 35.
The square root of 1371330197 is about 37031.4757604933. The cubic root of 1371330197 is about 1110.9998827965. Note that the first 3 decimals are identical.
The spelling of 1371330197 in words is "one billion, three hundred seventy-one million, three hundred thirty thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •