Base | Representation |
---|---|
bin | 11101011001101001011… |
… | …11010001000000010011 |
3 | 10120120111201111211102011 |
4 | 32230310233101000103 |
5 | 113022343220321321 |
6 | 2052025213203351 |
7 | 132661515225514 |
oct | 16546457210023 |
9 | 3516451454364 |
10 | 1010202120211 |
11 | 35a4738408a9 |
12 | 14394a790557 |
13 | 74352b0336b |
14 | 36c73380a0b |
15 | 1b42724bae1 |
hex | eb34bd1013 |
1010202120211 has 4 divisors (see below), whose sum is σ = 1012954714912. Its totient is φ = 1007449525512.
The previous prime is 1010202120197. The next prime is 1010202120233. The reversal of 1010202120211 is 1120212020101.
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 1010202120211 - 239 = 460446306323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010202120191 and 1010202120200.
It is not an unprimeable number, because it can be changed into a prime (1010202120241) 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 3 ways as a sum of consecutive naturals, for example, 1376296800 + ... + 1376297533.
It is an arithmetic number, because the mean of its divisors is an integer number (253238678728).
Almost surely, 21010202120211 is an apocalyptic number.
1010202120211 is a deficient number, since it is larger than the sum of its proper divisors (2752594701).
1010202120211 is an equidigital number, since it uses as much as digits as its factorization.
1010202120211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2752594700.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1010202120211 its reverse (1120212020101), we get a palindrome (2130414140312).
The spelling of 1010202120211 in words is "one trillion, ten billion, two hundred two million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •