Base | Representation |
---|---|
bin | 101101101101001111100101… |
… | …110100111000100000111001 |
3 | 222100202102212202210021202220 |
4 | 231231033211310320200321 |
5 | 202322012414302400441 |
6 | 1551311511420114253 |
7 | 60225205661640633 |
oct | 5555174564704071 |
9 | 870672782707686 |
10 | 201021210200121 |
11 | 59062686600553 |
12 | 1a667310695989 |
13 | 88222ac88849c |
14 | 378d69ad79a53 |
15 | 1839052924466 |
hex | b6d3e5d38839 |
201021210200121 has 8 divisors (see below), whose sum is σ = 268218506163360. Its totient is φ = 133919027185152.
The previous prime is 201021210200093. The next prime is 201021210200171. The reversal of 201021210200121 is 121002012120102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201021210200121 - 210 = 201021210199097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201021210200121.
It is not an unprimeable number, because it can be changed into a prime (201021210200171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23778232135 + ... + 23778240588.
It is an arithmetic number, because the mean of its divisors is an integer number (33527313270420).
Almost surely, 2201021210200121 is an apocalyptic number.
It is an amenable number.
201021210200121 is a deficient number, since it is larger than the sum of its proper divisors (67197295963239).
201021210200121 is a wasteful number, since it uses less digits than its factorization.
201021210200121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47556474135.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201021210200121 its reverse (121002012120102), we get a palindrome (322023222320223).
The spelling of 201021210200121 in words is "two hundred one trillion, twenty-one billion, two hundred ten million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •