Base | Representation |
---|---|
bin | 1000001101000100111111 |
3 | 11001021020021 |
4 | 20031010333 |
5 | 1022310334 |
6 | 114033011 |
7 | 24165214 |
oct | 10150477 |
9 | 4037207 |
10 | 2150719 |
11 | 123995a |
12 | 878767 |
13 | 5a3c1c |
14 | 3ddb0b |
15 | 2c73b4 |
hex | 20d13f |
2150719 has 2 divisors, whose sum is σ = 2150720. Its totient is φ = 2150718.
The previous prime is 2150717. The next prime is 2150741. The reversal of 2150719 is 9170512.
2150719 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
2150719 is an esthetic number in base 12, because in such base its adjacent digits differ by 1.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2150719 - 21 = 2150717 is a prime.
It is a super-2 number, since 2×21507192 = 9251184433922, which contains 22 as substring.
Together with 2150717, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2150693 and 2150702.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2150713) 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, 1075359 + 1075360.
It is an arithmetic number, because the mean of its divisors is an integer number (1075360).
22150719 is an apocalyptic number.
2150719 is a deficient number, since it is larger than the sum of its proper divisors (1).
2150719 is an equidigital number, since it uses as much as digits as its factorization.
2150719 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 25.
The square root of 2150719 is about 1466.5329863320. The cubic root of 2150719 is about 129.0806738532.
The spelling of 2150719 in words is "two million, one hundred fifty thousand, seven hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •