Base | Representation |
---|---|
bin | 10111111000011… |
… | …10101011000111 |
3 | 111221222020020100 |
4 | 23330032223013 |
5 | 402241304434 |
6 | 31513535143 |
7 | 4651563102 |
oct | 1374165307 |
9 | 457866210 |
10 | 200338119 |
11 | a30a3aa3 |
12 | 571144b3 |
13 | 32675187 |
14 | 1c86d739 |
15 | 128c4699 |
hex | bf0eac7 |
200338119 has 36 divisors (see below), whose sum is σ = 313152840. Its totient is φ = 123261600.
The previous prime is 200338097. The next prime is 200338121. The reversal of 200338119 is 911833002.
It is not a de Polignac number, because 200338119 - 215 = 200305351 is a prime.
It is a super-2 number, since 2×2003381192 = 80270723848916322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200338092 and 200338101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200338189) 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 35 ways as a sum of consecutive naturals, for example, 137344 + ... + 138794.
It is an arithmetic number, because the mean of its divisors is an integer number (8698690).
Almost surely, 2200338119 is an apocalyptic number.
200338119 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
200338119 is a deficient number, since it is larger than the sum of its proper divisors (112814721).
200338119 is a wasteful number, since it uses less digits than its factorization.
200338119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1532 (or 1506 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 200338119 is about 14154.0848874097. The cubic root of 200338119 is about 585.1329174198.
The spelling of 200338119 in words is "two hundred million, three hundred thirty-eight thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •