Base | Representation |
---|---|
bin | 1010001010010000… |
… | …01101000010110101 |
3 | 112002011001210111112 |
4 | 11011020031002311 |
5 | 42132403331111 |
6 | 2301134044405 |
7 | 252113400632 |
oct | 50510150265 |
9 | 15064053445 |
10 | 5454745781 |
11 | 234a075271 |
12 | 1082949705 |
13 | 68c12a734 |
14 | 39a637189 |
15 | 21dd30e8b |
hex | 14520d0b5 |
5454745781 has 2 divisors, whose sum is σ = 5454745782. Its totient is φ = 5454745780.
The previous prime is 5454745763. The next prime is 5454745789. The reversal of 5454745781 is 1875474545.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3693600625 + 1761145156 = 60775^2 + 41966^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5454745781 is a prime.
It is a super-2 number, since 2×54547457812 = 59508503070674599922, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5454745789) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2727372890 + 2727372891.
It is an arithmetic number, because the mean of its divisors is an integer number (2727372891).
Almost surely, 25454745781 is an apocalyptic number.
It is an amenable number.
5454745781 is a deficient number, since it is larger than the sum of its proper divisors (1).
5454745781 is an equidigital number, since it uses as much as digits as its factorization.
5454745781 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3136000, while the sum is 50.
The square root of 5454745781 is about 73856.2507916561. The cubic root of 5454745781 is about 1760.3195206949.
The spelling of 5454745781 in words is "five billion, four hundred fifty-four million, seven hundred forty-five thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •