Base | Representation |
---|---|
bin | 1100001111011011011… |
… | …1001110010111101001 |
3 | 202002211011202002100011 |
4 | 3003312313032113221 |
5 | 11421143311231441 |
6 | 240335513011521 |
7 | 21123301242154 |
oct | 3036667162751 |
9 | 662734662304 |
10 | 210300102121 |
11 | 81207a1a39a |
12 | 349110b3ba1 |
13 | 16aa6241a65 |
14 | a270042c9b |
15 | 570c861581 |
hex | 30f6dce5e9 |
210300102121 has 8 divisors (see below), whose sum is σ = 211926341088. Its totient is φ = 208674180000.
The previous prime is 210300102119. The next prime is 210300102143. The reversal of 210300102121 is 121201003012.
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 210300102121 - 21 = 210300102119 is a prime.
It is a super-2 number, since 2×2103001021212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210300102161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1353021 + ... + 1500421.
It is an arithmetic number, because the mean of its divisors is an integer number (26490792636).
Almost surely, 2210300102121 is an apocalyptic number.
It is an amenable number.
210300102121 is a deficient number, since it is larger than the sum of its proper divisors (1626238967).
210300102121 is a wasteful number, since it uses less digits than its factorization.
210300102121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158423.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 210300102121 its reverse (121201003012), we get a palindrome (331501105133).
The spelling of 210300102121 in words is "two hundred ten billion, three hundred million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •