Base | Representation |
---|---|
bin | 1001100111010000101101… |
… | …11110001001011011010001 |
3 | 2202211222120220001112110221 |
4 | 10303220112332021123101 |
5 | 10232330124342434301 |
6 | 112543402550153041 |
7 | 4311221135466631 |
oct | 463502676113321 |
9 | 82758526045427 |
10 | 21140214421201 |
11 | 6810572a09977 |
12 | 2455147052781 |
13 | ba468a6a78c5 |
14 | 53129858a6c1 |
15 | 269d8b075da1 |
hex | 133a16f896d1 |
21140214421201 has 2 divisors, whose sum is σ = 21140214421202. Its totient is φ = 21140214421200.
The previous prime is 21140214421153. The next prime is 21140214421217. The reversal of 21140214421201 is 10212441204112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16928279131201 + 4211935290000 = 4114399^2 + 2052300^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21140214421201 is a prime.
It is not a weakly prime, because it can be changed into another prime (21140214421901) 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, 10570107210600 + 10570107210601.
It is an arithmetic number, because the mean of its divisors is an integer number (10570107210601).
Almost surely, 221140214421201 is an apocalyptic number.
It is an amenable number.
21140214421201 is a deficient number, since it is larger than the sum of its proper divisors (1).
21140214421201 is an equidigital number, since it uses as much as digits as its factorization.
21140214421201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1024, while the sum is 25.
Adding to 21140214421201 its reverse (10212441204112), we get a palindrome (31352655625313).
The spelling of 21140214421201 in words is "twenty-one trillion, one hundred forty billion, two hundred fourteen million, four hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •