Base | Representation |
---|---|
bin | 100001000011110111110… |
… | …101101110101001000001 |
3 | 22001012011200011002002021 |
4 | 201003313311232221001 |
5 | 244210323100224223 |
6 | 4455410302321441 |
7 | 323065551036361 |
oct | 41036765565101 |
9 | 8035150132067 |
10 | 2271900789313 |
11 | 7a6564849211 |
12 | 308386b89281 |
13 | 136315a49a9c |
14 | 7bd63bb89a1 |
15 | 3e16d87965d |
hex | 210f7d6ea41 |
2271900789313 has 2 divisors, whose sum is σ = 2271900789314. Its totient is φ = 2271900789312.
The previous prime is 2271900789289. The next prime is 2271900789331. The reversal of 2271900789313 is 3139870091722.
2271900789313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (2271900789331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1703252077569 + 568648711744 = 1305087^2 + 754088^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2271900789313 is a prime.
It is not a weakly prime, because it can be changed into another prime (2271900789373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1135950394656 + 1135950394657.
It is an arithmetic number, because the mean of its divisors is an integer number (1135950394657).
Almost surely, 22271900789313 is an apocalyptic number.
It is an amenable number.
2271900789313 is a deficient number, since it is larger than the sum of its proper divisors (1).
2271900789313 is an equidigital number, since it uses as much as digits as its factorization.
2271900789313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1143072, while the sum is 52.
The spelling of 2271900789313 in words is "two trillion, two hundred seventy-one billion, nine hundred million, seven hundred eighty-nine thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •