Base | Representation |
---|---|
bin | 11101011101010111110… |
… | …01001001101001010011 |
3 | 10120202200001010121122011 |
4 | 32232223321021221103 |
5 | 113040442001401321 |
6 | 2052555424323351 |
7 | 133062201146215 |
oct | 16565371115123 |
9 | 3522601117564 |
10 | 1012201200211 |
11 | 3602aa20a233 |
12 | 144208173557 |
13 | 745b1017a36 |
14 | 36dc2a7a5b5 |
15 | 1b4e29cbae1 |
hex | ebabe49a53 |
1012201200211 has 4 divisors (see below), whose sum is σ = 1012203692632. Its totient is φ = 1012198707792.
The previous prime is 1012201200193. The next prime is 1012201200221. The reversal of 1012201200211 is 1120021022101.
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 1012201200211 - 213 = 1012201192019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012201200191 and 1012201200200.
It is not an unprimeable number, because it can be changed into a prime (1012201200221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 480021 + ... + 1501606.
It is an arithmetic number, because the mean of its divisors is an integer number (253050923158).
Almost surely, 21012201200211 is an apocalyptic number.
1012201200211 is a deficient number, since it is larger than the sum of its proper divisors (2492421).
1012201200211 is an equidigital number, since it uses as much as digits as its factorization.
1012201200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2492420.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1012201200211 its reverse (1120021022101), we get a palindrome (2132222222312).
The spelling of 1012201200211 in words is "one trillion, twelve billion, two hundred one million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •