Base | Representation |
---|---|
bin | 1100001110010111000… |
… | …0011010000000101001 |
3 | 202002002011200222100112 |
4 | 3003211300122000221 |
5 | 11420101323231441 |
6 | 240251221344105 |
7 | 21113214625364 |
oct | 3034560320051 |
9 | 662064628315 |
10 | 210013102121 |
11 | 8107aa15009 |
12 | 34850b68035 |
13 | 16a5b946184 |
14 | a243c950db |
15 | 56e256e4eb |
hex | 30e5c1a029 |
210013102121 has 4 divisors (see below), whose sum is σ = 210014029200. Its totient is φ = 210012175044.
The previous prime is 210013102109. The next prime is 210013102139. The reversal of 210013102121 is 121201310012.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 210013102121 - 210 = 210013101097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210013102096 and 210013102105.
It is not an unprimeable number, because it can be changed into a prime (210013102141) 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, 127250 + ... + 660468.
It is an arithmetic number, because the mean of its divisors is an integer number (52503507300).
Almost surely, 2210013102121 is an apocalyptic number.
It is an amenable number.
210013102121 is a deficient number, since it is larger than the sum of its proper divisors (927079).
210013102121 is an equidigital number, since it uses as much as digits as its factorization.
210013102121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 927078.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 210013102121 its reverse (121201310012), we get a palindrome (331214412133).
The spelling of 210013102121 in words is "two hundred ten billion, thirteen million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •