Base | Representation |
---|---|
bin | 111111110010100111011 |
3 | 10221012100111 |
4 | 13332110323 |
5 | 1013342144 |
6 | 112445151 |
7 | 23524111 |
oct | 7762473 |
9 | 3835314 |
10 | 2090299 |
11 | 11a8522 |
12 | 8497b7 |
13 | 582583 |
14 | 3c5ab1 |
15 | 2b4534 |
hex | 1fe53b |
2090299 has 4 divisors (see below), whose sum is σ = 2157760. Its totient is φ = 2022840.
The previous prime is 2090281. The next prime is 2090317. The reversal of 2090299 is 9920902.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 9920902 = 2 ⋅4960451.
It is an interprime number because it is at equal distance from previous prime (2090281) and next prime (2090317).
It is a cyclic number.
It is not a de Polignac number, because 2090299 - 213 = 2082107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31), and also a Moran number because the ratio is a prime number: 67429 = 2090299 / (2 + 0 + 9 + 0 + 2 + 9 + 9).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2090299.
It is not an unprimeable number, because it can be changed into a prime (2090219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33684 + ... + 33745.
It is an arithmetic number, because the mean of its divisors is an integer number (539440).
22090299 is an apocalyptic number.
2090299 is a deficient number, since it is larger than the sum of its proper divisors (67461).
2090299 is an equidigital number, since it uses as much as digits as its factorization.
2090299 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67460.
The product of its (nonzero) digits is 2916, while the sum is 31.
The square root of 2090299 is about 1445.7866370941. The cubic root of 2090299 is about 127.8604232128.
The spelling of 2090299 in words is "two million, ninety thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •