Base | Representation |
---|---|
bin | 100000000110110010011… |
… | …010101011110101101001 |
3 | 21210220212122110010200022 |
4 | 200012302122223311221 |
5 | 242122011230000401 |
6 | 4405322053450225 |
7 | 315254312565146 |
oct | 40066232536551 |
9 | 7726778403608 |
10 | 2206311562601 |
11 | 7807673a4423 |
12 | 2b7721340975 |
13 | 130092367c73 |
14 | 78b00cc33cd |
15 | 3c5d05ce71b |
hex | 201b26abd69 |
2206311562601 has 2 divisors, whose sum is σ = 2206311562602. Its totient is φ = 2206311562600.
The previous prime is 2206311562487. The next prime is 2206311562639. The reversal of 2206311562601 is 1062651136022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1911239890576 + 295071672025 = 1382476^2 + 543205^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2206311562601 is a prime.
It is a super-2 number, since 2×22063115626012 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2206311562001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1103155781300 + 1103155781301.
It is an arithmetic number, because the mean of its divisors is an integer number (1103155781301).
Almost surely, 22206311562601 is an apocalyptic number.
It is an amenable number.
2206311562601 is a deficient number, since it is larger than the sum of its proper divisors (1).
2206311562601 is an equidigital number, since it uses as much as digits as its factorization.
2206311562601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25920, while the sum is 35.
Adding to 2206311562601 its reverse (1062651136022), we get a palindrome (3268962698623).
The spelling of 2206311562601 in words is "two trillion, two hundred six billion, three hundred eleven million, five hundred sixty-two thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •