Base | Representation |
---|---|
bin | 11000111010111… |
… | …01100110110110 |
3 | 112120100211202000 |
4 | 30131131212312 |
5 | 412004100123 |
6 | 32424400130 |
7 | 5115616221 |
oct | 1435354666 |
9 | 476324660 |
10 | 209050038 |
11 | a800442a |
12 | 5a016046 |
13 | 34405662 |
14 | 1da9a5b8 |
15 | 13545b43 |
hex | c75d9b6 |
209050038 has 32 divisors (see below), whose sum is σ = 480578400. Its totient is φ = 67279968.
The previous prime is 209050033. The next prime is 209050043. The reversal of 209050038 is 830050902.
It is an interprime number because it is at equal distance from previous prime (209050033) and next prime (209050043).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 209049993 and 209050020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (209050033) 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 15 ways as a sum of consecutive naturals, for example, 65181 + ... + 68312.
It is an arithmetic number, because the mean of its divisors is an integer number (15018075).
Almost surely, 2209050038 is an apocalyptic number.
209050038 is an abundant number, since it is smaller than the sum of its proper divisors (271528362).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
209050038 is a wasteful number, since it uses less digits than its factorization.
209050038 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133533 (or 133527 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 209050038 is about 14458.5627916470. The cubic root of 209050038 is about 593.4945705666.
The spelling of 209050038 in words is "two hundred nine million, fifty thousand, thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •