Base | Representation |
---|---|
bin | 1001100100011010000010… |
… | …10111000010110100011001 |
3 | 2202111121110000020222000022 |
4 | 10302031001113002310121 |
5 | 10224223301140434001 |
6 | 112430343135520225 |
7 | 4301146610206142 |
oct | 462150127026431 |
9 | 82447400228008 |
10 | 21042141343001 |
11 | 6782a16247729 |
12 | 243a136689075 |
13 | b9835b16689c |
14 | 52a633400ac9 |
15 | 26754b0b611b |
hex | 1323415c2d19 |
21042141343001 has 2 divisors, whose sum is σ = 21042141343002. Its totient is φ = 21042141343000.
The previous prime is 21042141342973. The next prime is 21042141343037. The reversal of 21042141343001 is 10034314124012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20579387675401 + 462753667600 = 4536451^2 + 680260^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21042141343001 is a prime.
It is not a weakly prime, because it can be changed into another prime (21042141349001) 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, 10521070671500 + 10521070671501.
It is an arithmetic number, because the mean of its divisors is an integer number (10521070671501).
Almost surely, 221042141343001 is an apocalyptic number.
It is an amenable number.
21042141343001 is a deficient number, since it is larger than the sum of its proper divisors (1).
21042141343001 is an equidigital number, since it uses as much as digits as its factorization.
21042141343001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 21042141343001 its reverse (10034314124012), we get a palindrome (31076455467013).
The spelling of 21042141343001 in words is "twenty-one trillion, forty-two billion, one hundred forty-one million, three hundred forty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •