Base | Representation |
---|---|
bin | 1000001011110101… |
… | …0010111010100101 |
3 | 12200010020120021221 |
4 | 2002331102322211 |
5 | 13444424400331 |
6 | 1002003340341 |
7 | 105306044563 |
oct | 20275227245 |
9 | 5603216257 |
10 | 2197106341 |
11 | a28233571 |
12 | 5139816b1 |
13 | 29025a531 |
14 | 16bb26a33 |
15 | ccd49711 |
hex | 82f52ea5 |
2197106341 has 2 divisors, whose sum is σ = 2197106342. Its totient is φ = 2197106340.
The previous prime is 2197106339. The next prime is 2197106377. The reversal of 2197106341 is 1436017912.
2197106341 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., 2195297316 + 1809025 = 46854^2 + 1345^2 .
It is a cyclic number.
It is not a de Polignac number, because 2197106341 - 21 = 2197106339 is a prime.
Together with 2197106339, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2197106297 and 2197106306.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2197106941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1098553170 + 1098553171.
It is an arithmetic number, because the mean of its divisors is an integer number (1098553171).
Almost surely, 22197106341 is an apocalyptic number.
It is an amenable number.
2197106341 is a deficient number, since it is larger than the sum of its proper divisors (1).
2197106341 is an equidigital number, since it uses as much as digits as its factorization.
2197106341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9072, while the sum is 34.
The square root of 2197106341 is about 46873.3009398741. The cubic root of 2197106341 is about 1300.0209742178.
The spelling of 2197106341 in words is "two billion, one hundred ninety-seven million, one hundred six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •