Base | Representation |
---|---|
bin | 10111110110100… |
… | …10100101010111 |
3 | 111221111201121111 |
4 | 23323102211113 |
5 | 402210420431 |
6 | 31504355451 |
7 | 4646516401 |
oct | 1373224527 |
9 | 457451544 |
10 | 200091991 |
11 | a2a46090 |
12 | 57015b87 |
13 | 325ba138 |
14 | 1c807b71 |
15 | 128767b1 |
hex | bed2957 |
200091991 has 8 divisors (see below), whose sum is σ = 218421504. Its totient is φ = 181785720.
The previous prime is 200091961. The next prime is 200092003. The reversal of 200091991 is 199190002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200091991 - 25 = 200091959 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200091901) 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 7 ways as a sum of consecutive naturals, for example, 15666 + ... + 25408.
It is an arithmetic number, because the mean of its divisors is an integer number (27302688).
Almost surely, 2200091991 is an apocalyptic number.
200091991 is a deficient number, since it is larger than the sum of its proper divisors (18329513).
200091991 is a wasteful number, since it uses less digits than its factorization.
200091991 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11621.
The product of its (nonzero) digits is 1458, while the sum is 31.
The square root of 200091991 is about 14145.3876228260. The cubic root of 200091991 is about 584.8931950046.
The spelling of 200091991 in words is "two hundred million, ninety-one thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •