Base | Representation |
---|---|
bin | 100110001101101011010… |
… | …0101100011001011101101 |
3 | 200121002110102001002211201 |
4 | 1030123112211203023231 |
5 | 1142022144323001443 |
6 | 15100431503045501 |
7 | 1051306462066201 |
oct | 114332645431355 |
9 | 20532412032751 |
10 | 5252050203373 |
11 | 1745422467966 |
12 | 709a70ba0891 |
13 | 2c135cb2733c |
14 | 1422b45a0b01 |
15 | 9194051834d |
hex | 4c6d69632ed |
5252050203373 has 2 divisors, whose sum is σ = 5252050203374. Its totient is φ = 5252050203372.
The previous prime is 5252050203299. The next prime is 5252050203437. The reversal of 5252050203373 is 3733020502525.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3127443697764 + 2124606505609 = 1768458^2 + 1457603^2 .
It is a cyclic number.
It is not a de Polignac number, because 5252050203373 - 217 = 5252050072301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5252050201373) 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, 2626025101686 + 2626025101687.
It is an arithmetic number, because the mean of its divisors is an integer number (2626025101687).
Almost surely, 25252050203373 is an apocalyptic number.
It is an amenable number.
5252050203373 is a deficient number, since it is larger than the sum of its proper divisors (1).
5252050203373 is an equidigital number, since it uses as much as digits as its factorization.
5252050203373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 189000, while the sum is 37.
Adding to 5252050203373 its reverse (3733020502525), we get a palindrome (8985070705898).
The spelling of 5252050203373 in words is "five trillion, two hundred fifty-two billion, fifty million, two hundred three thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •