Base | Representation |
---|---|
bin | 10011111110000010… |
… | …10010001010101101 |
3 | 1000200011102002102202 |
4 | 21333001102022231 |
5 | 133424032240311 |
6 | 4531455431245 |
7 | 526450543256 |
oct | 117701221255 |
9 | 30604362382 |
10 | 10720977581 |
11 | 4601792156 |
12 | 20b2525525 |
13 | 101b192c22 |
14 | 739bdbb2d |
15 | 42b325e3b |
hex | 27f0522ad |
10720977581 has 2 divisors, whose sum is σ = 10720977582. Its totient is φ = 10720977580.
The previous prime is 10720977577. The next prime is 10720977653. The reversal of 10720977581 is 18577902701.
10720977581 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5671596100 + 5049381481 = 75310^2 + 71059^2 .
It is a cyclic number.
It is not a de Polignac number, because 10720977581 - 22 = 10720977577 is a prime.
It is a super-2 number, since 2×107209775812 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10720977571) 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, 5360488790 + 5360488791.
It is an arithmetic number, because the mean of its divisors is an integer number (5360488791).
Almost surely, 210720977581 is an apocalyptic number.
It is an amenable number.
10720977581 is a deficient number, since it is larger than the sum of its proper divisors (1).
10720977581 is an equidigital number, since it uses as much as digits as its factorization.
10720977581 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 246960, while the sum is 47.
The spelling of 10720977581 in words is "ten billion, seven hundred twenty million, nine hundred seventy-seven thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •