Base | Representation |
---|---|
bin | 1001100010011000… |
… | …11100011101101101 |
3 | 111012211202212020112 |
4 | 10301030130131231 |
5 | 40441300010242 |
6 | 2204030025405 |
7 | 240612641546 |
oct | 46114343555 |
9 | 14184685215 |
10 | 5120313197 |
11 | 21983130aa |
12 | baa948265 |
13 | 637a6522c |
14 | 36805d4cd |
15 | 1ee7bec82 |
hex | 13131c76d |
5120313197 has 2 divisors, whose sum is σ = 5120313198. Its totient is φ = 5120313196.
The previous prime is 5120313179. The next prime is 5120313223. The reversal of 5120313197 is 7913130215.
Together with previous prime (5120313179) 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., 4052722921 + 1067590276 = 63661^2 + 32674^2 .
It is a cyclic number.
It is not a de Polignac number, because 5120313197 - 214 = 5120296813 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5120313137) 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, 2560156598 + 2560156599.
It is an arithmetic number, because the mean of its divisors is an integer number (2560156599).
Almost surely, 25120313197 is an apocalyptic number.
It is an amenable number.
5120313197 is a deficient number, since it is larger than the sum of its proper divisors (1).
5120313197 is an equidigital number, since it uses as much as digits as its factorization.
5120313197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5670, while the sum is 32.
The square root of 5120313197 is about 71556.3637770953. The cubic root of 5120313197 is about 1723.5828951882.
The spelling of 5120313197 in words is "five billion, one hundred twenty million, three hundred thirteen thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •