Base | Representation |
---|---|
bin | 1011000000010111110011… |
… | …1111111110110110011001 |
3 | 1120211211211220001211121011 |
4 | 2300011330333332312121 |
5 | 3041230342111120441 |
6 | 41423044251413521 |
7 | 2356161362013424 |
oct | 260057477766631 |
9 | 46754756054534 |
10 | 12101020020121 |
11 | 394601736813a |
12 | 14353131542a1 |
13 | 69a176628b16 |
14 | 2db99a2bc9bb |
15 | 15eb96993581 |
hex | b017cffed99 |
12101020020121 has 4 divisors (see below), whose sum is σ = 12101062971700. Its totient is φ = 12100977068544.
The previous prime is 12101020020113. The next prime is 12101020020181. The reversal of 12101020020121 is 12102002010121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1803082298521 + 10297937721600 = 1342789^2 + 3209040^2 .
It is a cyclic number.
It is not a de Polignac number, because 12101020020121 - 23 = 12101020020113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12101020020181) 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, 21050376 + ... + 21617593.
It is an arithmetic number, because the mean of its divisors is an integer number (3025265742925).
Almost surely, 212101020020121 is an apocalyptic number.
It is an amenable number.
12101020020121 is a deficient number, since it is larger than the sum of its proper divisors (42951579).
12101020020121 is an equidigital number, since it uses as much as digits as its factorization.
12101020020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42951578.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12101020020121 its reverse (12102002010121), we get a palindrome (24203022030242).
The spelling of 12101020020121 in words is "twelve trillion, one hundred one billion, twenty million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •