Base | Representation |
---|---|
bin | 1011101001110011011… |
… | …1100000100111010101 |
3 | 201010202022011121121001 |
4 | 2322130313200213111 |
5 | 11240002233332241 |
6 | 231545403023301 |
7 | 20315102261044 |
oct | 2723467404725 |
9 | 633668147531 |
10 | 200200292821 |
11 | 779a4934161 |
12 | 3297280ab31 |
13 | 15b56979839 |
14 | 999293c55b |
15 | 531ad3a431 |
hex | 2e9cde09d5 |
200200292821 has 8 divisors (see below), whose sum is σ = 212107740480. Its totient is φ = 188307396288.
The previous prime is 200200292819. The next prime is 200200292827. The reversal of 200200292821 is 128292002002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200200292821 - 21 = 200200292819 is a prime.
It is a super-2 number, since 2×2002002928212 (a number of 23 digits) contains 22 as substring.
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 200200292821.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200200292827) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3609441 + ... + 3664486.
It is an arithmetic number, because the mean of its divisors is an integer number (26513467560).
Almost surely, 2200200292821 is an apocalyptic number.
It is an amenable number.
200200292821 is a deficient number, since it is larger than the sum of its proper divisors (11907447659).
200200292821 is a wasteful number, since it uses less digits than its factorization.
200200292821 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7275563.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 200200292821 its reverse (128292002002), we get a palindrome (328492294823).
The spelling of 200200292821 in words is "two hundred billion, two hundred million, two hundred ninety-two thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •