Base | Representation |
---|---|
bin | 1001001010001111100001… |
… | …10110101010101101110001 |
3 | 2122022122222020100121112121 |
4 | 10211013300312222231301 |
5 | 10120011123440413041 |
6 | 110501344254554241 |
7 | 4146202564223116 |
oct | 445076066525561 |
9 | 78278866317477 |
10 | 20143142513521 |
11 | 6466727900095 |
12 | 2313a61808981 |
13 | b3164ac37691 |
14 | 4d8d0cd8c90d |
15 | 24de818ec7d1 |
hex | 1251f0daab71 |
20143142513521 has 2 divisors, whose sum is σ = 20143142513522. Its totient is φ = 20143142513520.
The previous prime is 20143142513449. The next prime is 20143142513539. The reversal of 20143142513521 is 12531524134102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14121541842496 + 6021600671025 = 3757864^2 + 2453895^2 .
It is a cyclic number.
It is not a de Polignac number, because 20143142513521 - 231 = 20140995029873 is a prime.
It is not a weakly prime, because it can be changed into another prime (20143142013521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10071571256760 + 10071571256761.
It is an arithmetic number, because the mean of its divisors is an integer number (10071571256761).
Almost surely, 220143142513521 is an apocalyptic number.
It is an amenable number.
20143142513521 is a deficient number, since it is larger than the sum of its proper divisors (1).
20143142513521 is an equidigital number, since it uses as much as digits as its factorization.
20143142513521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 20143142513521 its reverse (12531524134102), we get a palindrome (32674666647623).
The spelling of 20143142513521 in words is "twenty trillion, one hundred forty-three billion, one hundred forty-two million, five hundred thirteen thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •