Base | Representation |
---|---|
bin | 1011101010100100000… |
… | …0110010110001110111 |
3 | 201011021111120201011110 |
4 | 2322221000302301313 |
5 | 11240411414144421 |
6 | 232021522210103 |
7 | 20323125226263 |
oct | 2725100626167 |
9 | 634244521143 |
10 | 200404053111 |
11 | 77a99955299 |
12 | 32a0aab3933 |
13 | 15b89c4c562 |
14 | 99b1a1d0a3 |
15 | 532db88a76 |
hex | 2ea9032c77 |
200404053111 has 8 divisors (see below), whose sum is σ = 267207885184. Its totient is φ = 133601461560.
The previous prime is 200404053103. The next prime is 200404053127. The reversal of 200404053111 is 111350404002.
200404053111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200404053111 - 23 = 200404053103 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 (200404053151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 175416 + ... + 656946.
It is an arithmetic number, because the mean of its divisors is an integer number (33400985648).
Almost surely, 2200404053111 is an apocalyptic number.
200404053111 is a deficient number, since it is larger than the sum of its proper divisors (66803832073).
200404053111 is a wasteful number, since it uses less digits than its factorization.
200404053111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 620261.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 200404053111 its reverse (111350404002), we get a palindrome (311754457113).
The spelling of 200404053111 in words is "two hundred billion, four hundred four million, fifty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •