Base | Representation |
---|---|
bin | 1001101001111000001110… |
… | …00001010111000000011001 |
3 | 2210011120201001001020002101 |
4 | 10310330013001113000121 |
5 | 10240313312113003032 |
6 | 113052554152003401 |
7 | 4320553455135424 |
oct | 464740701270031 |
9 | 83146631036071 |
10 | 21230141141017 |
11 | 684571a229526 |
12 | 246a663390561 |
13 | baccbc280313 |
14 | 5357898509bb |
15 | 26c3a0c79de7 |
hex | 134f07057019 |
21230141141017 has 2 divisors, whose sum is σ = 21230141141018. Its totient is φ = 21230141141016.
The previous prime is 21230141140961. The next prime is 21230141141057. The reversal of 21230141141017 is 71014114103212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17739629880336 + 3490511260681 = 4211844^2 + 1868291^2 .
It is a cyclic number.
It is not a de Polignac number, because 21230141141017 - 227 = 21230006923289 is a prime.
It is not a weakly prime, because it can be changed into another prime (21230141141057) 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, 10615070570508 + 10615070570509.
It is an arithmetic number, because the mean of its divisors is an integer number (10615070570509).
Almost surely, 221230141141017 is an apocalyptic number.
It is an amenable number.
21230141141017 is a deficient number, since it is larger than the sum of its proper divisors (1).
21230141141017 is an equidigital number, since it uses as much as digits as its factorization.
21230141141017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 28.
Adding to 21230141141017 its reverse (71014114103212), we get a palindrome (92244255244229).
The spelling of 21230141141017 in words is "twenty-one trillion, two hundred thirty billion, one hundred forty-one million, one hundred forty-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •