Base | Representation |
---|---|
bin | 1001001010010000000010… |
… | …11110101010100100001001 |
3 | 2122022200200200012020200012 |
4 | 10211020001132222210021 |
5 | 10120012211341342441 |
6 | 110501432101121305 |
7 | 4146212522056526 |
oct | 445100136524411 |
9 | 78280620166605 |
10 | 20143421434121 |
11 | 6466860297287 |
12 | 2313b1b0b9235 |
13 | b3169396495b |
14 | 4d8d3803614d |
15 | 24de9b1459eb |
hex | 1252017aa909 |
20143421434121 has 2 divisors, whose sum is σ = 20143421434122. Its totient is φ = 20143421434120.
The previous prime is 20143421434061. The next prime is 20143421434141. The reversal of 20143421434121 is 12143412434102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14411400175225 + 5732021258896 = 3796235^2 + 2394164^2 .
It is a cyclic number.
It is not a de Polignac number, because 20143421434121 - 242 = 15745374923017 is a prime.
It is not a weakly prime, because it can be changed into another prime (20143421434141) 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, 10071710717060 + 10071710717061.
It is an arithmetic number, because the mean of its divisors is an integer number (10071710717061).
Almost surely, 220143421434121 is an apocalyptic number.
It is an amenable number.
20143421434121 is a deficient number, since it is larger than the sum of its proper divisors (1).
20143421434121 is an equidigital number, since it uses as much as digits as its factorization.
20143421434121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 32.
Adding to 20143421434121 its reverse (12143412434102), we get a palindrome (32286833868223).
The spelling of 20143421434121 in words is "twenty trillion, one hundred forty-three billion, four hundred twenty-one million, four hundred thirty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •