Base | Representation |
---|---|
bin | 11011100001000100101010… |
… | …110001011011100000101001 |
3 | 120212111101210122121200021210 |
4 | 123201010222301123200221 |
5 | 111330242440320201301 |
6 | 1105215454154423333 |
7 | 34330256456401203 |
oct | 3341045261334051 |
9 | 525441718550253 |
10 | 121020011100201 |
11 | 3561933130a944 |
12 | 116a65a4a31b49 |
13 | 526b1a44886b5 |
14 | 21c558504b773 |
15 | ded01cacbad6 |
hex | 6e112ac5b829 |
121020011100201 has 4 divisors (see below), whose sum is σ = 161360014800272. Its totient is φ = 80680007400132.
The previous prime is 121020011100179. The next prime is 121020011100283. The reversal of 121020011100201 is 102001110020121.
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 121020011100201 - 211 = 121020011098153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121020011100101) 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, 20170001850031 + ... + 20170001850036.
It is an arithmetic number, because the mean of its divisors is an integer number (40340003700068).
Almost surely, 2121020011100201 is an apocalyptic number.
It is an amenable number.
121020011100201 is a deficient number, since it is larger than the sum of its proper divisors (40340003700071).
121020011100201 is an equidigital number, since it uses as much as digits as its factorization.
121020011100201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40340003700070.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 121020011100201 its reverse (102001110020121), we get a palindrome (223021121120322).
The spelling of 121020011100201 in words is "one hundred twenty-one trillion, twenty billion, eleven million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •