Base | Representation |
---|---|
bin | 100100100011101111010… |
… | …1100111110011011011101 |
3 | 122210100020202002220002002 |
4 | 1021013132230332123131 |
5 | 1124310241043213041 |
6 | 14404125310412045 |
7 | 1026004052451056 |
oct | 111073654763335 |
9 | 18710222086062 |
10 | 5024553101021 |
11 | 16679a0265793 |
12 | 691960801025 |
13 | 2a5a75b483cc |
14 | 13529263b72d |
15 | 8aa7806959b |
hex | 491deb3e6dd |
5024553101021 has 2 divisors, whose sum is σ = 5024553101022. Its totient is φ = 5024553101020.
The previous prime is 5024553101003. The next prime is 5024553101033. The reversal of 5024553101021 is 1201013554205.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4936124184121 + 88428916900 = 2221739^2 + 297370^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5024553101021 is a prime.
It is a super-2 number, since 2×50245531010212 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5024553101041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2512276550510 + 2512276550511.
It is an arithmetic number, because the mean of its divisors is an integer number (2512276550511).
Almost surely, 25024553101021 is an apocalyptic number.
It is an amenable number.
5024553101021 is a deficient number, since it is larger than the sum of its proper divisors (1).
5024553101021 is an equidigital number, since it uses as much as digits as its factorization.
5024553101021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6000, while the sum is 29.
Adding to 5024553101021 its reverse (1201013554205), we get a palindrome (6225566655226).
The spelling of 5024553101021 in words is "five trillion, twenty-four billion, five hundred fifty-three million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •