Base | Representation |
---|---|
bin | 10011111101111100… |
… | …11001011111010001 |
3 | 1000200002222122210022 |
4 | 21332332121133101 |
5 | 133423334034022 |
6 | 4531431313225 |
7 | 526441243013 |
oct | 117676313721 |
9 | 30602878708 |
10 | 10720221137 |
11 | 460131589a |
12 | 20b221b815 |
13 | 101ac89822 |
14 | 739a821b3 |
15 | 42b226c42 |
hex | 27ef997d1 |
10720221137 has 2 divisors, whose sum is σ = 10720221138. Its totient is φ = 10720221136.
The previous prime is 10720221067. The next prime is 10720221139. The reversal of 10720221137 is 73112202701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10708938256 + 11282881 = 103484^2 + 3359^2 .
It is an emirp because it is prime and its reverse (73112202701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10720221137 - 210 = 10720220113 is a prime.
It is a super-2 number, since 2×107202211372 (a number of 21 digits) contains 22 as substring.
Together with 10720221139, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10720221139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5360110568 + 5360110569.
It is an arithmetic number, because the mean of its divisors is an integer number (5360110569).
Almost surely, 210720221137 is an apocalyptic number.
It is an amenable number.
10720221137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10720221137 is an equidigital number, since it uses as much as digits as its factorization.
10720221137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1176, while the sum is 26.
Adding to 10720221137 its reverse (73112202701), we get a palindrome (83832423838).
The spelling of 10720221137 in words is "ten billion, seven hundred twenty million, two hundred twenty-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •