Base | Representation |
---|---|
bin | 101101011110101100010001… |
… | …001111000101101001111011 |
3 | 222020012211201010002002102111 |
4 | 231132230101033011221323 |
5 | 202204121420021010021 |
6 | 1545224250441113151 |
7 | 60063025034631424 |
oct | 5536542117055173 |
9 | 866184633062374 |
10 | 200021211110011 |
11 | 58807579147235 |
12 | 1a52554aa887b7 |
13 | 877bbc484ab55 |
14 | 3757114acc64b |
15 | 181d0262dc8e1 |
hex | b5eb113c5a7b |
200021211110011 has 8 divisors (see below), whose sum is σ = 206473681828224. Its totient is φ = 193568751240960.
The previous prime is 200021211109991. The next prime is 200021211110027. The reversal of 200021211110011 is 110011112120002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200021211110011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200021211109973 and 200021211110000.
It is not an unprimeable number, because it can be changed into a prime (200021211110711) 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, 52772235 + ... + 56435371.
It is an arithmetic number, because the mean of its divisors is an integer number (25809210228528).
Almost surely, 2200021211110011 is an apocalyptic number.
200021211110011 is a deficient number, since it is larger than the sum of its proper divisors (6452470718213).
200021211110011 is a wasteful number, since it uses less digits than its factorization.
200021211110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5424581.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 200021211110011 its reverse (110011112120002), we get a palindrome (310032323230013).
The spelling of 200021211110011 in words is "two hundred trillion, twenty-one billion, two hundred eleven million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •