Base | Representation |
---|---|
bin | 10111111110001… |
… | …00011011100101 |
3 | 112000101001110121 |
4 | 23333010123211 |
5 | 402434120342 |
6 | 31541521541 |
7 | 4661113432 |
oct | 1377043345 |
9 | 460331417 |
10 | 201082597 |
11 | a3562371 |
12 | 574132b1 |
13 | 32875cb1 |
14 | 1c9c4b89 |
15 | 129c0067 |
hex | bfc46e5 |
201082597 has 2 divisors, whose sum is σ = 201082598. Its totient is φ = 201082596.
The previous prime is 201082559. The next prime is 201082631. The reversal of 201082597 is 795280102.
It is an a-pointer prime, because the next prime (201082631) can be obtained adding 201082597 to its sum of digits (34).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 135699201 + 65383396 = 11649^2 + 8086^2 .
It is a cyclic number.
It is not a de Polignac number, because 201082597 - 227 = 66864869 is a prime.
It is equal to p11135599 and since 201082597 and 11135599 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201082397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100541298 + 100541299.
It is an arithmetic number, because the mean of its divisors is an integer number (100541299).
Almost surely, 2201082597 is an apocalyptic number.
It is an amenable number.
201082597 is a deficient number, since it is larger than the sum of its proper divisors (1).
201082597 is an equidigital number, since it uses as much as digits as its factorization.
201082597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10080, while the sum is 34.
The square root of 201082597 is about 14180.3595511538. The cubic root of 201082597 is about 585.8568270710.
The spelling of 201082597 in words is "two hundred one million, eighty-two thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •