Base | Representation |
---|---|
bin | 101101100001011100001101… |
… | …000110000101001100110011 |
3 | 222020212220022111212012222111 |
4 | 231201130031012011030303 |
5 | 202220220311232413021 |
6 | 1545451132014350151 |
7 | 60112463263462654 |
oct | 5541341506051463 |
9 | 866786274765874 |
10 | 200210120201011 |
11 | 5887a6a9428338 |
12 | 1a5560901bb357 |
13 | 879396c162a7b |
14 | 3762315bd752b |
15 | 1822dd0c168e1 |
hex | b6170d185333 |
200210120201011 has 4 divisors (see below), whose sum is σ = 200366656652800. Its totient is φ = 200053583749224.
The previous prime is 200210120200969. The next prime is 200210120201033. The reversal of 200210120201011 is 110102021012002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200210120201011 - 221 = 200210118103859 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200210120200982 and 200210120201000.
It is not an unprimeable number, because it can be changed into a prime (200210120207011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78268223976 + ... + 78268226533.
It is an arithmetic number, because the mean of its divisors is an integer number (50091664163200).
Almost surely, 2200210120201011 is an apocalyptic number.
200210120201011 is a deficient number, since it is larger than the sum of its proper divisors (156536451789).
200210120201011 is a wasteful number, since it uses less digits than its factorization.
200210120201011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156536451788.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200210120201011 its reverse (110102021012002), we get a palindrome (310312141213013).
The spelling of 200210120201011 in words is "two hundred trillion, two hundred ten billion, one hundred twenty million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •