Base | Representation |
---|---|
bin | 10100010001111001… |
… | …011101101110110001 |
3 | 2002012112201100200202 |
4 | 110101321131232301 |
5 | 324043412110022 |
6 | 14000420124545 |
7 | 1400415256601 |
oct | 242171355661 |
9 | 62175640622 |
10 | 21775113137 |
11 | 9264535878 |
12 | 4278536755 |
13 | 209039313b |
14 | 10a7d60c01 |
15 | 876a0a592 |
hex | 511e5dbb1 |
21775113137 has 4 divisors (see below), whose sum is σ = 21779653476. Its totient is φ = 21770572800.
The previous prime is 21775113089. The next prime is 21775113149. The reversal of 21775113137 is 73131157712.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 17359643536 + 4415469601 = 131756^2 + 66449^2 .
It is a cyclic number.
It is not a de Polignac number, because 21775113137 - 210 = 21775112113 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21775113137.
It is not an unprimeable number, because it can be changed into a prime (21775113337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2262968 + ... + 2272569.
It is an arithmetic number, because the mean of its divisors is an integer number (5444913369).
Almost surely, 221775113137 is an apocalyptic number.
It is an amenable number.
21775113137 is a deficient number, since it is larger than the sum of its proper divisors (4540339).
21775113137 is an equidigital number, since it uses as much as digits as its factorization.
21775113137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4540338.
The product of its digits is 30870, while the sum is 38.
The spelling of 21775113137 in words is "twenty-one billion, seven hundred seventy-five million, one hundred thirteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •