Base | Representation |
---|---|
bin | 10111010011010010111010… |
… | …11000011100011101110101 |
3 | 20201102112202101200102120111 |
4 | 23221221131120130131311 |
5 | 23204011044242433141 |
6 | 300551323430103021 |
7 | 13536002005100104 |
oct | 1351513530343565 |
9 | 221375671612514 |
10 | 51240526530421 |
11 | 15365a92430328 |
12 | 58b69107aaa71 |
13 | 2278c651a3ca7 |
14 | c920aa20003b |
15 | 5dcd3c68b381 |
hex | 2e9a5d61c775 |
51240526530421 has 2 divisors, whose sum is σ = 51240526530422. Its totient is φ = 51240526530420.
The previous prime is 51240526530419. The next prime is 51240526530443. The reversal of 51240526530421 is 12403562504215.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49238485476196 + 2002041054225 = 7017014^2 + 1414935^2 .
It is a cyclic number.
It is not a de Polignac number, because 51240526530421 - 21 = 51240526530419 is a prime.
It is a super-2 number, since 2×512405265304212 (a number of 28 digits) contains 22 as substring.
Together with 51240526530419, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51240526530481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25620263265210 + 25620263265211.
It is an arithmetic number, because the mean of its divisors is an integer number (25620263265211).
Almost surely, 251240526530421 is an apocalyptic number.
It is an amenable number.
51240526530421 is a deficient number, since it is larger than the sum of its proper divisors (1).
51240526530421 is an equidigital number, since it uses as much as digits as its factorization.
51240526530421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288000, while the sum is 40.
The spelling of 51240526530421 in words is "fifty-one trillion, two hundred forty billion, five hundred twenty-six million, five hundred thirty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •