Base | Representation |
---|---|
bin | 111000011001000111… |
… | …1100010111001110101 |
3 | 102120120210211001000220 |
4 | 1300302033202321311 |
5 | 3441004104121323 |
6 | 131344500324553 |
7 | 11515010121216 |
oct | 1606217427165 |
9 | 376523731026 |
10 | 121102020213 |
11 | 473a4a2a229 |
12 | 1b5789a3759 |
13 | b55c5c4735 |
14 | 5c0b84d40d |
15 | 323bada0e3 |
hex | 1c323e2e75 |
121102020213 has 8 divisors (see below), whose sum is σ = 163879351008. Its totient is φ = 79529684784.
The previous prime is 121102020209. The next prime is 121102020217. The reversal of 121102020213 is 312020201121.
It is an interprime number because it is at equal distance from previous prime (121102020209) and next prime (121102020217).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121102020213 - 22 = 121102020209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121102020192 and 121102020201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121102020217) 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, 301248606 + ... + 301249007.
It is an arithmetic number, because the mean of its divisors is an integer number (20484918876).
Almost surely, 2121102020213 is an apocalyptic number.
It is an amenable number.
121102020213 is a deficient number, since it is larger than the sum of its proper divisors (42777330795).
121102020213 is an equidigital number, since it uses as much as digits as its factorization.
121102020213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 602497683.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 121102020213 its reverse (312020201121), we get a palindrome (433122221334).
The spelling of 121102020213 in words is "one hundred twenty-one billion, one hundred two million, twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •