Base | Representation |
---|---|
bin | 11011100000111100011110… |
… | …110101110111000000001001 |
3 | 120212110120010001111022221112 |
4 | 123200330132311313000021 |
5 | 111330121440034001301 |
6 | 1105211442032220105 |
7 | 34326525602646410 |
oct | 3340743665670011 |
9 | 525416101438845 |
10 | 121011221000201 |
11 | 35615630553694 |
12 | 116a495109a635 |
13 | 526a40334a8ac |
14 | 21c4d8d874477 |
15 | decba60629bb |
hex | 6e0f1ed77009 |
121011221000201 has 4 divisors (see below), whose sum is σ = 138298538285952. Its totient is φ = 103723903714452.
The previous prime is 121011221000167. The next prime is 121011221000333. The reversal of 121011221000201 is 102000122110121.
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 not a de Polignac number, because 121011221000201 - 226 = 121011153891337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121011221002201) 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, 8643658642865 + ... + 8643658642878.
It is an arithmetic number, because the mean of its divisors is an integer number (34574634571488).
Almost surely, 2121011221000201 is an apocalyptic number.
It is an amenable number.
121011221000201 is a deficient number, since it is larger than the sum of its proper divisors (17287317285751).
121011221000201 is an equidigital number, since it uses as much as digits as its factorization.
121011221000201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17287317285750.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 121011221000201 its reverse (102000122110121), we get a palindrome (223011343110322).
The spelling of 121011221000201 in words is "one hundred twenty-one trillion, eleven billion, two hundred twenty-one million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •