Base | Representation |
---|---|
bin | 10011111000001010… |
… | …010000011111011001 |
3 | 2001002110012101001011 |
4 | 103320022100133121 |
5 | 322202341321422 |
6 | 13445513053521 |
7 | 1353623056663 |
oct | 237012203731 |
9 | 61073171034 |
10 | 21343307737 |
11 | 9062817004 |
12 | 41779b72a1 |
13 | 2021a96b9b |
14 | 106687b533 |
15 | 84db63077 |
hex | 4f82907d9 |
21343307737 has 2 divisors, whose sum is σ = 21343307738. Its totient is φ = 21343307736.
The previous prime is 21343307681. The next prime is 21343307771. The reversal of 21343307737 is 73770334312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20543775561 + 799532176 = 143331^2 + 28276^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21343307737 is a prime.
It is a super-2 number, since 2×213433077372 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21343307737.
It is not a weakly prime, because it can be changed into another prime (21343307437) 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, 10671653868 + 10671653869.
It is an arithmetic number, because the mean of its divisors is an integer number (10671653869).
Almost surely, 221343307737 is an apocalyptic number.
It is an amenable number.
21343307737 is a deficient number, since it is larger than the sum of its proper divisors (1).
21343307737 is an equidigital number, since it uses as much as digits as its factorization.
21343307737 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 222264, while the sum is 40.
The spelling of 21343307737 in words is "twenty-one billion, three hundred forty-three million, three hundred seven thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •