Base | Representation |
---|---|
bin | 1000011101100011… |
… | …10101010111101101 |
3 | 102201121021211200022 |
4 | 10032301311113231 |
5 | 33300441140411 |
6 | 2030442211525 |
7 | 220402054226 |
oct | 41661652755 |
9 | 12647254608 |
10 | 4542911981 |
11 | 1a213a0013 |
12 | a694b3ba5 |
13 | 57524c8ca |
14 | 3114ba24d |
15 | 1b8c67edb |
hex | 10ec755ed |
4542911981 has 2 divisors, whose sum is σ = 4542911982. Its totient is φ = 4542911980.
The previous prime is 4542911977. The next prime is 4542912029. The reversal of 4542911981 is 1891192454.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4423447081 + 119464900 = 66509^2 + 10930^2 .
It is a cyclic number.
It is not a de Polignac number, because 4542911981 - 22 = 4542911977 is a prime.
It is a super-2 number, since 2×45429119812 = 41276098534226688722, 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 (4542919981) 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, 2271455990 + 2271455991.
It is an arithmetic number, because the mean of its divisors is an integer number (2271455991).
Almost surely, 24542911981 is an apocalyptic number.
It is an amenable number.
4542911981 is a deficient number, since it is larger than the sum of its proper divisors (1).
4542911981 is an equidigital number, since it uses as much as digits as its factorization.
4542911981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 103680, while the sum is 44.
The square root of 4542911981 is about 67401.1274460598. The cubic root of 4542911981 is about 1656.1948917874.
The spelling of 4542911981 in words is "four billion, five hundred forty-two million, nine hundred eleven thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •