Base | Representation |
---|---|
bin | 111110010010101… |
… | …1111000001111000 |
3 | 12101200002020000120 |
4 | 1330211133001320 |
5 | 13240042414313 |
6 | 543224133240 |
7 | 102540263034 |
oct | 17445370170 |
9 | 5350066016 |
10 | 2090201208 |
11 | 982956117 |
12 | 4a4007220 |
13 | 274069a64 |
14 | 15b8591c4 |
15 | c377dd23 |
hex | 7c95f078 |
2090201208 has 16 divisors (see below), whose sum is σ = 5225503080. Its totient is φ = 696733728.
The previous prime is 2090201207. The next prime is 2090201209. The reversal of 2090201208 is 8021020902.
It is an interprime number because it is at equal distance from previous prime (2090201207) and next prime (2090201209).
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 87091717 = 2090201208 / (2 + 0 + 9 + 0 + 2 + 0 + 1 + 2 + 0 + 8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2090201203) 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 in 3 ways as a sum of consecutive naturals, for example, 43545835 + ... + 43545882.
Almost surely, 22090201208 is an apocalyptic number.
It is an amenable number.
2090201208 is an abundant number, since it is smaller than the sum of its proper divisors (3135301872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2090201208 is a wasteful number, since it uses less digits than its factorization.
2090201208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87091726 (or 87091722 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 24.
The square root of 2090201208 is about 45718.7183547396. The cubic root of 2090201208 is about 1278.5842925218.
The spelling of 2090201208 in words is "two billion, ninety million, two hundred one thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •