Base | Representation |
---|---|
bin | 100101000111110100111… |
… | …1010100110011000101101 |
3 | 200001202021200101102122221 |
4 | 1022033221322212120231 |
5 | 1132042444430231021 |
6 | 14503503311435341 |
7 | 1034416366555231 |
oct | 112175172463055 |
9 | 20052250342587 |
10 | 5102050633261 |
11 | 169784963279a |
12 | 6a498a525b51 |
13 | 2b017669876a |
14 | 138d24cc25c1 |
15 | 8cab19c1241 |
hex | 4a3e9ea662d |
5102050633261 has 2 divisors, whose sum is σ = 5102050633262. Its totient is φ = 5102050633260.
The previous prime is 5102050633247. The next prime is 5102050633297. The reversal of 5102050633261 is 1623360502015.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3274673875236 + 1827376758025 = 1809606^2 + 1351805^2 .
It is a cyclic number.
It is not a de Polignac number, because 5102050633261 - 219 = 5102050108973 is a prime.
It is a super-2 number, since 2×51020506332612 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5102050631261) 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, 2551025316630 + 2551025316631.
It is an arithmetic number, because the mean of its divisors is an integer number (2551025316631).
Almost surely, 25102050633261 is an apocalyptic number.
It is an amenable number.
5102050633261 is a deficient number, since it is larger than the sum of its proper divisors (1).
5102050633261 is an equidigital number, since it uses as much as digits as its factorization.
5102050633261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 34.
The spelling of 5102050633261 in words is "five trillion, one hundred two billion, fifty million, six hundred thirty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •