Base | Representation |
---|---|
bin | 10001011110100010011… |
… | …000100001000000000001 |
3 | 11020211001011102012122111 |
4 | 101132202120201000001 |
5 | 124134142133224301 |
6 | 2315424023135321 |
7 | 152525254232506 |
oct | 21364230410001 |
9 | 4224034365574 |
10 | 1201020211201 |
11 | 423393664948 |
12 | 1749232a4541 |
13 | 89342a80485 |
14 | 421b5c174ad |
15 | 21394560551 |
hex | 117a2621001 |
1201020211201 has 2 divisors, whose sum is σ = 1201020211202. Its totient is φ = 1201020211200.
The previous prime is 1201020211199. The next prime is 1201020211207. The reversal of 1201020211201 is 1021120201021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1103863321201 + 97156890000 = 1050649^2 + 311700^2 .
It is a cyclic number.
It is not a de Polignac number, because 1201020211201 - 21 = 1201020211199 is a prime.
Together with 1201020211199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1201020211207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600510105600 + 600510105601.
It is an arithmetic number, because the mean of its divisors is an integer number (600510105601).
Almost surely, 21201020211201 is an apocalyptic number.
It is an amenable number.
1201020211201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201020211201 is an equidigital number, since it uses as much as digits as its factorization.
1201020211201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1201020211201 its reverse (1021120201021), we get a palindrome (2222140412222).
The spelling of 1201020211201 in words is "one trillion, two hundred one billion, twenty million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •