Base | Representation |
---|---|
bin | 100110001101010011011… |
… | …1011011101010101000101 |
3 | 200121000101200112002100202 |
4 | 1030122212323131111011 |
5 | 1142014030130441242 |
6 | 15100220301420245 |
7 | 1051250612652212 |
oct | 114324673352505 |
9 | 20530350462322 |
10 | 5251250640197 |
11 | 17450520a5251 |
12 | 70988926a685 |
13 | 2c1263298233 |
14 | 14223a30ab09 |
15 | 918e522a932 |
hex | 4c6a6edd545 |
5251250640197 has 2 divisors, whose sum is σ = 5251250640198. Its totient is φ = 5251250640196.
The previous prime is 5251250640113. The next prime is 5251250640203. The reversal of 5251250640197 is 7910460521525.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5251128073156 + 122567041 = 2291534^2 + 11071^2 .
It is a cyclic number.
It is not a de Polignac number, because 5251250640197 - 224 = 5251233862981 is a prime.
It is a super-3 number, since 3×52512506401973 (a number of 39 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5251250640107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2625625320098 + 2625625320099.
It is an arithmetic number, because the mean of its divisors is an integer number (2625625320099).
Almost surely, 25251250640197 is an apocalyptic number.
It is an amenable number.
5251250640197 is a deficient number, since it is larger than the sum of its proper divisors (1).
5251250640197 is an equidigital number, since it uses as much as digits as its factorization.
5251250640197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756000, while the sum is 47.
The spelling of 5251250640197 in words is "five trillion, two hundred fifty-one billion, two hundred fifty million, six hundred forty thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •