Base | Representation |
---|---|
bin | 1001100100001111000111… |
… | …10101000010100000000001 |
3 | 2202111001022022210122020111 |
4 | 10302013203311002200001 |
5 | 10224124243424233132 |
6 | 112423533214311321 |
7 | 4300551362513212 |
oct | 462074365024001 |
9 | 82431268718214 |
10 | 21036277180417 |
11 | 6780487065574 |
12 | 2438b7a7b8541 |
13 | b9793527b5b5 |
14 | 52a238671409 |
15 | 267306361647 |
hex | 1321e3d42801 |
21036277180417 has 2 divisors, whose sum is σ = 21036277180418. Its totient is φ = 21036277180416.
The previous prime is 21036277180393. The next prime is 21036277180421. The reversal of 21036277180417 is 71408177263012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17756034591681 + 3280242588736 = 4213791^2 + 1811144^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21036277180417 is a prime.
It is a super-2 number, since 2×210362771804172 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21036277183417) 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, 10518138590208 + 10518138590209.
It is an arithmetic number, because the mean of its divisors is an integer number (10518138590209).
Almost surely, 221036277180417 is an apocalyptic number.
It is an amenable number.
21036277180417 is a deficient number, since it is larger than the sum of its proper divisors (1).
21036277180417 is an equidigital number, since it uses as much as digits as its factorization.
21036277180417 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 790272, while the sum is 49.
The spelling of 21036277180417 in words is "twenty-one trillion, thirty-six billion, two hundred seventy-seven million, one hundred eighty thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •