Base | Representation |
---|---|
bin | 10011000101001010110… |
… | …011101111000001010001 |
3 | 11122100111011221122112220 |
4 | 103011022303233001101 |
5 | 132440334321214301 |
6 | 2442211033211253 |
7 | 163506153651603 |
oct | 23051263570121 |
9 | 4570434848486 |
10 | 1311220101201 |
11 | 4660a36222aa |
12 | 192158b60b29 |
13 | 968557c658a |
14 | 4766b791173 |
15 | 24193e8e936 |
hex | 1314acef051 |
1311220101201 has 4 divisors (see below), whose sum is σ = 1748293468272. Its totient is φ = 874146734132.
The previous prime is 1311220101199. The next prime is 1311220101223. The reversal of 1311220101201 is 1021010221131.
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 1311220101201 - 21 = 1311220101199 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1311220101241) 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, 218536683531 + ... + 218536683536.
It is an arithmetic number, because the mean of its divisors is an integer number (437073367068).
Almost surely, 21311220101201 is an apocalyptic number.
It is an amenable number.
1311220101201 is a deficient number, since it is larger than the sum of its proper divisors (437073367071).
1311220101201 is an equidigital number, since it uses as much as digits as its factorization.
1311220101201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 437073367070.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1311220101201 its reverse (1021010221131), we get a palindrome (2332230322332).
The spelling of 1311220101201 in words is "one trillion, three hundred eleven billion, two hundred twenty million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •