Base | Representation |
---|---|
bin | 1000101000001110111000… |
… | …00100010010110100111001 |
3 | 2111011221122220012022011201 |
4 | 10110013130010102310321 |
5 | 4441334401020102031 |
6 | 104204443241054201 |
7 | 3665603231316451 |
oct | 424073404226471 |
9 | 74157586168151 |
10 | 18974562659641 |
11 | 6056080a56906 |
12 | 2165492787361 |
13 | a783a7cc8314 |
14 | 498533746d61 |
15 | 22d88a35ed61 |
hex | 1141dc112d39 |
18974562659641 has 2 divisors, whose sum is σ = 18974562659642. Its totient is φ = 18974562659640.
The previous prime is 18974562659629. The next prime is 18974562659681. The reversal of 18974562659641 is 14695626547981.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11363607290025 + 7610955369616 = 3370995^2 + 2758796^2 .
It is a cyclic number.
It is not a de Polignac number, because 18974562659641 - 237 = 18837123706169 is a prime.
It is a super-2 number, since 2×189745626596412 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (18974562659621) 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, 9487281329820 + 9487281329821.
It is an arithmetic number, because the mean of its divisors is an integer number (9487281329821).
Almost surely, 218974562659641 is an apocalyptic number.
It is an amenable number.
18974562659641 is a deficient number, since it is larger than the sum of its proper divisors (1).
18974562659641 is an equidigital number, since it uses as much as digits as its factorization.
18974562659641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 783820800, while the sum is 73.
The spelling of 18974562659641 in words is "eighteen trillion, nine hundred seventy-four billion, five hundred sixty-two million, six hundred fifty-nine thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •