Base | Representation |
---|---|
bin | 101001000110011001011… |
… | …1111000010000010110001 |
3 | 202000000101012221112102022 |
4 | 1102030302333002002301 |
5 | 1220022103232102411 |
6 | 20002554422001225 |
7 | 1122051656331461 |
oct | 122146277020261 |
9 | 22000335845368 |
10 | 5648737378481 |
11 | 1888685a9594a |
12 | 77291a876215 |
13 | 31c89b012a62 |
14 | 1575867a9ba1 |
15 | 9be0b178edb |
hex | 52332fc20b1 |
5648737378481 has 2 divisors, whose sum is σ = 5648737378482. Its totient is φ = 5648737378480.
The previous prime is 5648737378451. The next prime is 5648737378553. The reversal of 5648737378481 is 1848737378465.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5065627983025 + 583109395456 = 2250695^2 + 763616^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5648737378481 is a prime.
It is a super-2 number, since 2×56487373784812 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5648737378421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2824368689240 + 2824368689241.
It is an arithmetic number, because the mean of its divisors is an integer number (2824368689241).
Almost surely, 25648737378481 is an apocalyptic number.
It is an amenable number.
5648737378481 is a deficient number, since it is larger than the sum of its proper divisors (1).
5648737378481 is an equidigital number, since it uses as much as digits as its factorization.
5648737378481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 758661120, while the sum is 71.
The spelling of 5648737378481 in words is "five trillion, six hundred forty-eight billion, seven hundred thirty-seven million, three hundred seventy-eight thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •