Base | Representation |
---|---|
bin | 1000000000111111110101 |
3 | 10221202100121 |
4 | 20000333311 |
5 | 1014214422 |
6 | 113011541 |
7 | 23601025 |
oct | 10007765 |
9 | 3852317 |
10 | 2101237 |
11 | 1205766 |
12 | 853bb1 |
13 | 587548 |
14 | 3c9a85 |
15 | 2b78c7 |
hex | 200ff5 |
2101237 has 2 divisors, whose sum is σ = 2101238. Its totient is φ = 2101236.
The previous prime is 2101223. The next prime is 2101243. The reversal of 2101237 is 7321012.
It is a happy number.
2101237 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1196836 + 904401 = 1094^2 + 951^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2101237 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2101237.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2101207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050618 + 1050619.
It is an arithmetic number, because the mean of its divisors is an integer number (1050619).
22101237 is an apocalyptic number.
It is an amenable number.
2101237 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101237 is an equidigital number, since it uses as much as digits as its factorization.
2101237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 16.
The square root of 2101237 is about 1449.5644173337. The cubic root of 2101237 is about 128.0830556336.
Adding to 2101237 its reverse (7321012), we get a palindrome (9422249).
The spelling of 2101237 in words is "two million, one hundred one thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •