Base | Representation |
---|---|
bin | 100001000011101011101… |
… | …001001111101100101001 |
3 | 22001011122102011100221011 |
4 | 201003223221033230221 |
5 | 244204413211041444 |
6 | 4455334113143521 |
7 | 323060515005553 |
oct | 41035351175451 |
9 | 8034572140834 |
10 | 2271696190249 |
11 | 7a646a304982 |
12 | 30832a55aba1 |
13 | 1362b2542355 |
14 | 7bd4495a4d3 |
15 | 3e15a912734 |
hex | 210eba4fb29 |
2271696190249 has 2 divisors, whose sum is σ = 2271696190250. Its totient is φ = 2271696190248.
The previous prime is 2271696190243. The next prime is 2271696190297. The reversal of 2271696190249 is 9420916961722.
2271696190249 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., 1816314157849 + 455382032400 = 1347707^2 + 674820^2 .
It is a cyclic number.
It is not a de Polignac number, because 2271696190249 - 215 = 2271696157481 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2271696190193 and 2271696190202.
It is not a weakly prime, because it can be changed into another prime (2271696190243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1135848095124 + 1135848095125.
It is an arithmetic number, because the mean of its divisors is an integer number (1135848095125).
Almost surely, 22271696190249 is an apocalyptic number.
It is an amenable number.
2271696190249 is a deficient number, since it is larger than the sum of its proper divisors (1).
2271696190249 is an equidigital number, since it uses as much as digits as its factorization.
2271696190249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5878656, while the sum is 58.
The spelling of 2271696190249 in words is "two trillion, two hundred seventy-one billion, six hundred ninety-six million, one hundred ninety thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •