Base | Representation |
---|---|
bin | 10010110000101011… |
… | …101010001010111001 |
3 | 1220222212200111221102 |
4 | 102300223222022321 |
5 | 312223342312441 |
6 | 13130514021145 |
7 | 1312122026351 |
oct | 226053521271 |
9 | 56885614842 |
10 | 20144104121 |
11 | 85a7904639 |
12 | 3aa22777b5 |
13 | 1b904c104b |
14 | d914b7b61 |
15 | 7cd73369b |
hex | 4b0aea2b9 |
20144104121 has 2 divisors, whose sum is σ = 20144104122. Its totient is φ = 20144104120.
The previous prime is 20144104109. The next prime is 20144104147. The reversal of 20144104121 is 12140144102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19821542521 + 322561600 = 140789^2 + 17960^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20144104121 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20144104093 and 20144104102.
It is not a weakly prime, because it can be changed into another prime (20144304121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10072052060 + 10072052061.
It is an arithmetic number, because the mean of its divisors is an integer number (10072052061).
Almost surely, 220144104121 is an apocalyptic number.
It is an amenable number.
20144104121 is a deficient number, since it is larger than the sum of its proper divisors (1).
20144104121 is an equidigital number, since it uses as much as digits as its factorization.
20144104121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 20144104121 its reverse (12140144102), we get a palindrome (32284248223).
The spelling of 20144104121 in words is "twenty billion, one hundred forty-four million, one hundred four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •