Base | Representation |
---|---|
bin | 1001100011001011111011… |
… | …00001110011001000110101 |
3 | 2202100121012010100000010222 |
4 | 10301211331201303020311 |
5 | 10223031402441403412 |
6 | 112355205331224125 |
7 | 4265133363211322 |
oct | 461457541631065 |
9 | 82317163300128 |
10 | 21000201122357 |
11 | 6767154072156 |
12 | 2431b90a48045 |
13 | b9440613a692 |
14 | 5285b5299b49 |
15 | 2663e40c9072 |
hex | 13197d873235 |
21000201122357 has 2 divisors, whose sum is σ = 21000201122358. Its totient is φ = 21000201122356.
The previous prime is 21000201122203. The next prime is 21000201122363. The reversal of 21000201122357 is 75322110200012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17027251235281 + 3972949887076 = 4126409^2 + 1993226^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21000201122357 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21000201121357) 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, 10500100561178 + 10500100561179.
It is an arithmetic number, because the mean of its divisors is an integer number (10500100561179).
Almost surely, 221000201122357 is an apocalyptic number.
It is an amenable number.
21000201122357 is a deficient number, since it is larger than the sum of its proper divisors (1).
21000201122357 is an equidigital number, since it uses as much as digits as its factorization.
21000201122357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 26.
Adding to 21000201122357 its reverse (75322110200012), we get a palindrome (96322311322369).
The spelling of 21000201122357 in words is "twenty-one trillion, two hundred one million, one hundred twenty-two thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •