Base | Representation |
---|---|
bin | 1100011001100100001… |
… | …1000101011001111001 |
3 | 202100211210211010022121 |
4 | 3012121003011121321 |
5 | 11442231401320441 |
6 | 241505513521241 |
7 | 21250601434225 |
oct | 3063103053171 |
9 | 670753733277 |
10 | 213021120121 |
11 | 823839614a7 |
12 | 35350413221 |
13 | 1711aba7094 |
14 | a44b587785 |
15 | 581b698dd1 |
hex | 31990c5679 |
213021120121 has 8 divisors (see below), whose sum is σ = 213451844864. Its totient is φ = 212590532880.
The previous prime is 213021120107. The next prime is 213021120133. The reversal of 213021120121 is 121021120312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 213021120121 - 25 = 213021120089 is a prime.
It is a super-2 number, since 2×2130211201212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 213021120095 and 213021120104.
It is not an unprimeable number, because it can be changed into a prime (213021120161) 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, 3413626 + ... + 3475468.
It is an arithmetic number, because the mean of its divisors is an integer number (26681480608).
Almost surely, 2213021120121 is an apocalyptic number.
It is an amenable number.
213021120121 is a deficient number, since it is larger than the sum of its proper divisors (430724743).
213021120121 is an equidigital number, since it uses as much as digits as its factorization.
213021120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68751.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 213021120121 its reverse (121021120312), we get a palindrome (334042240433).
The spelling of 213021120121 in words is "two hundred thirteen billion, twenty-one million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •