Base | Representation |
---|---|
bin | 101101101110101101100100… |
… | …101001010011111100101001 |
3 | 222101010002100111101000022000 |
4 | 231232231210221103330221 |
5 | 202330141101230333001 |
6 | 1551430121040521213 |
7 | 60235410451054614 |
oct | 5556554451237451 |
9 | 871102314330260 |
10 | 201122122121001 |
11 | 590a145a770274 |
12 | 1a682993920209 |
13 | 882b9722a6583 |
14 | 379451117b17b |
15 | 183b9abc42a86 |
hex | b6eb64a53f29 |
201122122121001 has 32 divisors (see below), whose sum is σ = 299719297987200. Its totient is φ = 133289625530880.
The previous prime is 201122122120967. The next prime is 201122122121023. The reversal of 201122122121001 is 100121221221102.
201122122121001 is a `hidden beast` number, since 2 + 0 + 11 + 221 + 221 + 210 + 0 + 1 = 666.
It is not a de Polignac number, because 201122122121001 - 219 = 201122121596713 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (201122122121071) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8416965 + ... + 21750621.
It is an arithmetic number, because the mean of its divisors is an integer number (9366228062100).
Almost surely, 2201122122121001 is an apocalyptic number.
It is an amenable number.
201122122121001 is a deficient number, since it is larger than the sum of its proper divisors (98597175866199).
201122122121001 is a wasteful number, since it uses less digits than its factorization.
201122122121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13336966 (or 13336960 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 201122122121001 its reverse (100121221221102), we get a palindrome (301243343342103).
The spelling of 201122122121001 in words is "two hundred one trillion, one hundred twenty-two billion, one hundred twenty-two million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •