Base | Representation |
---|---|
bin | 100111010111111011000… |
… | …0011101011000100011001 |
3 | 201011100000011212202022202 |
4 | 1032233312003223010121 |
5 | 1202130213421434031 |
6 | 15302001033455545 |
7 | 1065652546624502 |
oct | 116576603530431 |
9 | 21140004782282 |
10 | 5411491983641 |
11 | 17a70011692a7 |
12 | 7349498715b5 |
13 | 3033bc536313 |
14 | 149cbbcc5ba9 |
15 | 95b72e8c2cb |
hex | 4ebf60eb119 |
5411491983641 has 2 divisors, whose sum is σ = 5411491983642. Its totient is φ = 5411491983640.
The previous prime is 5411491983631. The next prime is 5411491983643. The reversal of 5411491983641 is 1463891941145.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5100239573641 + 311252410000 = 2258371^2 + 557900^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5411491983641 is a prime.
It is a Sophie Germain prime.
Together with 5411491983643, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (5411491983643) 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, 2705745991820 + 2705745991821.
It is an arithmetic number, because the mean of its divisors is an integer number (2705745991821).
Almost surely, 25411491983641 is an apocalyptic number.
It is an amenable number.
5411491983641 is a deficient number, since it is larger than the sum of its proper divisors (1).
5411491983641 is an equidigital number, since it uses as much as digits as its factorization.
5411491983641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3732480, while the sum is 56.
The spelling of 5411491983641 in words is "five trillion, four hundred eleven billion, four hundred ninety-one million, nine hundred eighty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •