Base | Representation |
---|---|
bin | 101101101110101101100100… |
… | …101001001111010011110001 |
3 | 222101010002100111100001020022 |
4 | 231232231210221033103301 |
5 | 202330141101224231001 |
6 | 1551430121040253225 |
7 | 60235410450645332 |
oct | 5556554451172361 |
9 | 871102314301208 |
10 | 201122122102001 |
11 | 590a145a757a71 |
12 | 1a682993911215 |
13 | 882b97229aa29 |
14 | 3794511174289 |
15 | 183b9abc3c11b |
hex | b6eb64a4f4f1 |
201122122102001 has 4 divisors (see below), whose sum is σ = 201122231515632. Its totient is φ = 201122012688372.
The previous prime is 201122122101959. The next prime is 201122122102037. The reversal of 201122122102001 is 100201221221102.
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 a de Polignac number, because none of the positive numbers 2k-201122122102001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201122122102901) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51901595 + ... + 55641888.
It is an arithmetic number, because the mean of its divisors is an integer number (50280557878908).
Almost surely, 2201122122102001 is an apocalyptic number.
It is an amenable number.
201122122102001 is a deficient number, since it is larger than the sum of its proper divisors (109413631).
201122122102001 is a wasteful number, since it uses less digits than its factorization.
201122122102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109413630.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 201122122102001 its reverse (100201221221102), we get a palindrome (301323343323103).
The spelling of 201122122102001 in words is "two hundred one trillion, one hundred twenty-two billion, one hundred twenty-two million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •