Base | Representation |
---|---|
bin | 101001000110101100010… |
… | …1111000111001011101101 |
3 | 202000002000100201121022111 |
4 | 1102031120233013023231 |
5 | 1220024402402130222 |
6 | 20003141325044021 |
7 | 1122103446655045 |
oct | 122153057071355 |
9 | 22002010647274 |
10 | 5649370739437 |
11 | 188898055a357 |
12 | 772a769b6611 |
13 | 31c96c2bc359 |
14 | 157606958725 |
15 | 9be46a86777 |
hex | 52358bc72ed |
5649370739437 has 2 divisors, whose sum is σ = 5649370739438. Its totient is φ = 5649370739436.
The previous prime is 5649370739407. The next prime is 5649370739543. The reversal of 5649370739437 is 7349370739465.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5591361535236 + 58009204201 = 2364606^2 + 240851^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5649370739437 is a prime.
It is a super-2 number, since 2×56493707394372 (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 (5649370739407) 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, 2824685369718 + 2824685369719.
It is an arithmetic number, because the mean of its divisors is an integer number (2824685369719).
Almost surely, 25649370739437 is an apocalyptic number.
It is an amenable number.
5649370739437 is a deficient number, since it is larger than the sum of its proper divisors (1).
5649370739437 is an equidigital number, since it uses as much as digits as its factorization.
5649370739437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360067680, while the sum is 67.
The spelling of 5649370739437 in words is "five trillion, six hundred forty-nine billion, three hundred seventy million, seven hundred thirty-nine thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •