Base | Representation |
---|---|
bin | 11110101110001101011… |
… | …101010000111001110001 |
3 | 21110211101022101222100120 |
4 | 132232031131100321301 |
5 | 234042220230414301 |
6 | 4253512314040453 |
7 | 305346362422212 |
oct | 36561535207161 |
9 | 7424338358316 |
10 | 2111202201201 |
11 | 7443a0670505 |
12 | 2a11b9419129 |
13 | 124115b46622 |
14 | 7427b5b7409 |
15 | 39db58e7e36 |
hex | 1eb8d750e71 |
2111202201201 has 4 divisors (see below), whose sum is σ = 2814936268272. Its totient is φ = 1407468134132.
The previous prime is 2111202201167. The next prime is 2111202201299. The reversal of 2111202201201 is 1021022021112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2111202201201 - 29 = 2111202200689 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2111202201601) 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, 351867033531 + ... + 351867033536.
It is an arithmetic number, because the mean of its divisors is an integer number (703734067068).
Almost surely, 22111202201201 is an apocalyptic number.
It is an amenable number.
2111202201201 is a deficient number, since it is larger than the sum of its proper divisors (703734067071).
2111202201201 is an equidigital number, since it uses as much as digits as its factorization.
2111202201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703734067070.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2111202201201 its reverse (1021022021112), we get a palindrome (3132224222313).
The spelling of 2111202201201 in words is "two trillion, one hundred eleven billion, two hundred two million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •