Base | Representation |
---|---|
bin | 10001100111110101001… |
… | …110110001110100111001 |
3 | 11021202210200100012102002 |
4 | 101213311032301310321 |
5 | 124320112011232301 |
6 | 2324154210550345 |
7 | 153330466012601 |
oct | 21476516616471 |
9 | 4252720305362 |
10 | 1211000102201 |
11 | 427644a9474a |
12 | 1768495983b5 |
13 | 8a273549a16 |
14 | 42881423c01 |
15 | 2177a79a16b |
hex | 119f53b1d39 |
1211000102201 has 4 divisors (see below), whose sum is σ = 1212629981952. Its totient is φ = 1209370222452.
The previous prime is 1211000102183. The next prime is 1211000102231. The reversal of 1211000102201 is 1022010001121.
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 1211000102201 - 214 = 1211000085817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1211000102231) 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, 814938761 + ... + 814940246.
It is an arithmetic number, because the mean of its divisors is an integer number (303157495488).
Almost surely, 21211000102201 is an apocalyptic number.
It is an amenable number.
1211000102201 is a deficient number, since it is larger than the sum of its proper divisors (1629879751).
1211000102201 is an equidigital number, since it uses as much as digits as its factorization.
1211000102201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1629879750.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1211000102201 its reverse (1022010001121), we get a palindrome (2233010103322).
The spelling of 1211000102201 in words is "one trillion, two hundred eleven billion, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •