Base | Representation |
---|---|
bin | 100100110001000110011… |
… | …1000110101101110000001 |
3 | 122220002022100110002201112 |
4 | 1021202030320311232001 |
5 | 1130243021241003213 |
6 | 14425232343013105 |
7 | 1031041061631332 |
oct | 111421470655601 |
9 | 18802270402645 |
10 | 5053245250433 |
11 | 167908422a266 |
12 | 69742973a195 |
13 | 2a8699287103 |
14 | 1368150c0289 |
15 | 8b6a6e51ea8 |
hex | 4988ce35b81 |
5053245250433 has 2 divisors, whose sum is σ = 5053245250434. Its totient is φ = 5053245250432.
The previous prime is 5053245250399. The next prime is 5053245250439. The reversal of 5053245250433 is 3340525423505.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5052658787344 + 586463089 = 2247812^2 + 24217^2 .
It is a cyclic number.
It is not a de Polignac number, because 5053245250433 - 226 = 5053178141569 is a prime.
It is a super-2 number, since 2×50532452504332 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5053245250439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2526622625216 + 2526622625217.
It is an arithmetic number, because the mean of its divisors is an integer number (2526622625217).
Almost surely, 25053245250433 is an apocalyptic number.
It is an amenable number.
5053245250433 is a deficient number, since it is larger than the sum of its proper divisors (1).
5053245250433 is an equidigital number, since it uses as much as digits as its factorization.
5053245250433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080000, while the sum is 41.
The spelling of 5053245250433 in words is "five trillion, fifty-three billion, two hundred forty-five million, two hundred fifty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •