Base | Representation |
---|---|
bin | 101101101111111000000100… |
… | …111101100101000111111001 |
3 | 222101101201211202202022002022 |
4 | 231233320010331211013321 |
5 | 202332443421011400441 |
6 | 1551530551202444225 |
7 | 60244242062032466 |
oct | 5557700475450771 |
9 | 871351752668068 |
10 | 201202121200121 |
11 | 591223820a8498 |
12 | 1a69639b363675 |
13 | 8836381178192 |
14 | 379833db5666d |
15 | 183dae00cd84b |
hex | b6fe04f651f9 |
201202121200121 has 16 divisors (see below), whose sum is σ = 202538906169600. Its totient is φ = 199868832313920.
The previous prime is 201202121200103. The next prime is 201202121200123. The reversal of 201202121200121 is 121002121202102.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201202121200121 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201202121200121.
It is not an unprimeable number, because it can be changed into a prime (201202121200123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 334725575 + ... + 335326131.
It is an arithmetic number, because the mean of its divisors is an integer number (12658681635600).
Almost surely, 2201202121200121 is an apocalyptic number.
It is an amenable number.
201202121200121 is a deficient number, since it is larger than the sum of its proper divisors (1336784969479).
201202121200121 is a wasteful number, since it uses less digits than its factorization.
201202121200121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 603464.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 201202121200121 its reverse (121002121202102), we get a palindrome (322204242402223).
The spelling of 201202121200121 in words is "two hundred one trillion, two hundred two billion, one hundred twenty-one million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •