Base | Representation |
---|---|
bin | 100100110000101000110… |
… | …1000011110000011001001 |
3 | 122212222202001210012102021 |
4 | 1021201101220132003021 |
5 | 1130234002240302213 |
6 | 14424545551004441 |
7 | 1031004330545512 |
oct | 111412150360311 |
9 | 18788661705367 |
10 | 5052251103433 |
11 | 1678714043976 |
12 | 6971b0809721 |
13 | 2a856b319051 |
14 | 13675d057a09 |
15 | 8b649a29d8d |
hex | 49851a1e0c9 |
5052251103433 has 2 divisors, whose sum is σ = 5052251103434. Its totient is φ = 5052251103432.
The previous prime is 5052251103413. The next prime is 5052251103451. The reversal of 5052251103433 is 3343011522505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4613354128384 + 438896975049 = 2147872^2 + 662493^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5052251103433 is a prime.
It is not a weakly prime, because it can be changed into another prime (5052251103413) 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, 2526125551716 + 2526125551717.
It is an arithmetic number, because the mean of its divisors is an integer number (2526125551717).
Almost surely, 25052251103433 is an apocalyptic number.
It is an amenable number.
5052251103433 is a deficient number, since it is larger than the sum of its proper divisors (1).
5052251103433 is an equidigital number, since it uses as much as digits as its factorization.
5052251103433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54000, while the sum is 34.
Adding to 5052251103433 its reverse (3343011522505), we get a palindrome (8395262625938).
The spelling of 5052251103433 in words is "five trillion, fifty-two billion, two hundred fifty-one million, one hundred three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •