Base | Representation |
---|---|
bin | 10001011101010010… |
… | …101101011000111101 |
3 | 1210101101010110001012 |
4 | 101131102231120331 |
5 | 301342213223111 |
6 | 12340015325005 |
7 | 1232343223325 |
oct | 213522553075 |
9 | 53341113035 |
10 | 18745054781 |
11 | 7a4a105112 |
12 | 3771820765 |
13 | 19c96b61bb |
14 | c9b772285 |
15 | 74a9ca48b |
hex | 45d4ad63d |
18745054781 has 2 divisors, whose sum is σ = 18745054782. Its totient is φ = 18745054780.
The previous prime is 18745054753. The next prime is 18745054793.
It is a happy number.
18745054781 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18730385881 + 14668900 = 136859^2 + 3830^2 .
It is a palprime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-18745054781 is a prime.
It is a super-2 number, since 2×187450547812 (a number of 21 digits) contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (18745057781) 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, 9372527390 + 9372527391.
It is an arithmetic number, because the mean of its divisors is an integer number (9372527391).
Almost surely, 218745054781 is an apocalyptic number.
It is an amenable number.
18745054781 is a deficient number, since it is larger than the sum of its proper divisors (1).
18745054781 is an equidigital number, since it uses as much as digits as its factorization.
18745054781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1254400, while the sum is 50.
The spelling of 18745054781 in words is "eighteen billion, seven hundred forty-five million, fifty-four thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •