Base | Representation |
---|---|
bin | 101101011110100011111001… |
… | …010101001001110011100101 |
3 | 222020011222111111221001221220 |
4 | 231132203321111021303211 |
5 | 202204000011322041401 |
6 | 1545220202340530553 |
7 | 60062256161462505 |
oct | 5536437125116345 |
9 | 866158444831856 |
10 | 200012220112101 |
11 | 58803784a44451 |
12 | 1a52385b9b0a59 |
13 | 877b0c0c00147 |
14 | 375690097ba05 |
15 | 181cb9bcdd336 |
hex | b5e8f9549ce5 |
200012220112101 has 8 divisors (see below), whose sum is σ = 266709450997344. Its totient is φ = 133328234650800.
The previous prime is 200012220112051. The next prime is 200012220112157. The reversal of 200012220112101 is 101211022210002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200012220112101 - 214 = 200012220095717 is a prime.
It is a super-2 number, since 2×2000122201121012 (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 (200012220112501) 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, 3311320750 + ... + 3311381151.
It is an arithmetic number, because the mean of its divisors is an integer number (33338681374668).
Almost surely, 2200012220112101 is an apocalyptic number.
It is an amenable number.
200012220112101 is a deficient number, since it is larger than the sum of its proper divisors (66697230885243).
200012220112101 is a wasteful number, since it uses less digits than its factorization.
200012220112101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6622711971.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200012220112101 its reverse (101211022210002), we get a palindrome (301223242322103).
The spelling of 200012220112101 in words is "two hundred trillion, twelve billion, two hundred twenty million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •