Base | Representation |
---|---|
bin | 1011101001111100111… |
… | …1011111011111011111 |
3 | 201010212002010202120101 |
4 | 2322133033133133133 |
5 | 11240042433242421 |
6 | 231553345001531 |
7 | 20316065025313 |
oct | 2723717373737 |
9 | 633762122511 |
10 | 200240134111 |
11 | 77a15376546 |
12 | 329840232a7 |
13 | 15b61cb9074 |
14 | 9997d4db43 |
15 | 531e5aa191 |
hex | 2e9f3df7df |
200240134111 has 8 divisors (see below), whose sum is σ = 200953186560. Its totient is φ = 199527283872.
The previous prime is 200240134097. The next prime is 200240134121. The reversal of 200240134111 is 111431042002.
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 200240134111 - 213 = 200240125919 is a prime.
It is a super-2 number, since 2×2002401341112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200240134121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2094786 + ... + 2188288.
It is an arithmetic number, because the mean of its divisors is an integer number (25119148320).
Almost surely, 2200240134111 is an apocalyptic number.
200240134111 is a deficient number, since it is larger than the sum of its proper divisors (713052449).
200240134111 is an equidigital number, since it uses as much as digits as its factorization.
200240134111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101105.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 200240134111 its reverse (111431042002), we get a palindrome (311671176113).
The spelling of 200240134111 in words is "two hundred billion, two hundred forty million, one hundred thirty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •