Base | Representation |
---|---|
bin | 101101100001010010111101… |
… | …111011111010101111111111 |
3 | 222020211221201022101200012220 |
4 | 231201102331323322233333 |
5 | 202220040003230431421 |
6 | 1545442411521300423 |
7 | 60111662433050166 |
oct | 5541227573725777 |
9 | 866757638350186 |
10 | 200200202202111 |
11 | 58876479a30a31 |
12 | 1a554182794713 |
13 | 8792a4b456777 |
14 | 3761a548dc3dd |
15 | 1822a001553c6 |
hex | b614bdefabff |
200200202202111 has 8 divisors (see below), whose sum is σ = 266933809767600. Its totient is φ = 133466698052352.
The previous prime is 200200202202071. The next prime is 200200202202199. The reversal of 200200202202111 is 111202202002002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200200202202111 - 213 = 200200202193919 is a prime.
It is a super-2 number, since 2×2002002022021112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200200202202311) 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, 21218136 + ... + 29165213.
It is an arithmetic number, because the mean of its divisors is an integer number (33366726220950).
Almost surely, 2200200202202111 is an apocalyptic number.
200200202202111 is a deficient number, since it is larger than the sum of its proper divisors (66733607565489).
200200202202111 is a wasteful number, since it uses less digits than its factorization.
200200202202111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51707865.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200200202202111 its reverse (111202202002002), we get a palindrome (311402404204113).
The spelling of 200200202202111 in words is "two hundred trillion, two hundred billion, two hundred two million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •