Base | Representation |
---|---|
bin | 1001010001110110001010… |
… | …0000110111010010000011 |
3 | 1100010022122212102010011011 |
4 | 2110131202200313102003 |
5 | 2314123101212011321 |
6 | 33410454231101351 |
7 | 2102041013046634 |
oct | 224354240672203 |
9 | 40108585363134 |
10 | 10202200110211 |
11 | 3283801a9a61a |
12 | 1189308211857 |
13 | 5900a9217255 |
14 | 273b094b988b |
15 | 12a5b1606ae1 |
hex | 94762837483 |
10202200110211 has 8 divisors (see below), whose sum is σ = 10325362859280. Its totient is φ = 10079043186912.
The previous prime is 10202200110149. The next prime is 10202200110247. The reversal of 10202200110211 is 11201100220201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10202200110211 - 219 = 10202199585923 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10202200110191 and 10202200110200.
It is not an unprimeable number, because it can be changed into a prime (10202200110511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2119821 + ... + 4989793.
It is an arithmetic number, because the mean of its divisors is an integer number (1290670357410).
Almost surely, 210202200110211 is an apocalyptic number.
10202200110211 is a deficient number, since it is larger than the sum of its proper divisors (123162749069).
10202200110211 is an equidigital number, since it uses as much as digits as its factorization.
10202200110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2912885.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10202200110211 its reverse (11201100220201), we get a palindrome (21403300330412).
The spelling of 10202200110211 in words is "ten trillion, two hundred two billion, two hundred million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •