Base | Representation |
---|---|
bin | 1001100011100000100110… |
… | …00101001000000101001101 |
3 | 2202101122211122001122200021 |
4 | 10301300103011020011031 |
5 | 10223222120312413312 |
6 | 112404242533302141 |
7 | 4266005414154544 |
oct | 461602305100515 |
9 | 82348748048607 |
10 | 21011300122957 |
11 | 677092a179621 |
12 | 2434169a94951 |
13 | b95484718961 |
14 | 528d4937b15b |
15 | 2668436c1c07 |
hex | 131c1314814d |
21011300122957 has 2 divisors, whose sum is σ = 21011300122958. Its totient is φ = 21011300122956.
The previous prime is 21011300122951. The next prime is 21011300123029. The reversal of 21011300122957 is 75922100311012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17361438890436 + 3649861232521 = 4166706^2 + 1910461^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21011300122957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21011300122951) 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, 10505650061478 + 10505650061479.
It is an arithmetic number, because the mean of its divisors is an integer number (10505650061479).
Almost surely, 221011300122957 is an apocalyptic number.
It is an amenable number.
21011300122957 is a deficient number, since it is larger than the sum of its proper divisors (1).
21011300122957 is an equidigital number, since it uses as much as digits as its factorization.
21011300122957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 34.
Adding to 21011300122957 its reverse (75922100311012), we get a palindrome (96933400433969).
The spelling of 21011300122957 in words is "twenty-one trillion, eleven billion, three hundred million, one hundred twenty-two thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •