Base | Representation |
---|---|
bin | 1000111001100100000101011… |
… | …1010100000001001001011101 |
3 | 10001010100011012122122101121121 |
4 | 2032121001113110001021131 |
5 | 1124040322212412014131 |
6 | 10055523343513330541 |
7 | 245623331645031265 |
oct | 21631012724011135 |
9 | 3033304178571547 |
10 | 626242056360541 |
11 | 1715a384579a795 |
12 | 5a2a1aa5706a51 |
13 | 20b584ac57074a |
14 | b0903c4ad47a5 |
15 | 4c5eed673e911 |
hex | 239905750125d |
626242056360541 has 2 divisors, whose sum is σ = 626242056360542. Its totient is φ = 626242056360540.
The previous prime is 626242056360461. The next prime is 626242056360611. The reversal of 626242056360541 is 145063650242626.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 439945381265625 + 186296675094916 = 20974875^2 + 13649054^2 .
It is a cyclic number.
It is not a de Polignac number, because 626242056360541 - 219 = 626242055836253 is a prime.
It is a super-2 number, since 2×6262420563605412 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (626242056364541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 313121028180270 + 313121028180271.
It is an arithmetic number, because the mean of its divisors is an integer number (313121028180271).
Almost surely, 2626242056360541 is an apocalyptic number.
It is an amenable number.
626242056360541 is a deficient number, since it is larger than the sum of its proper divisors (1).
626242056360541 is an equidigital number, since it uses as much as digits as its factorization.
626242056360541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12441600, while the sum is 52.
The spelling of 626242056360541 in words is "six hundred twenty-six trillion, two hundred forty-two billion, fifty-six million, three hundred sixty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •