Base | Representation |
---|---|
bin | 1011110000111111100… |
… | …1100001100110111101 |
3 | 201022201210122002221112 |
4 | 2330033321201212331 |
5 | 11302430312413041 |
6 | 232505103411405 |
7 | 20413655234420 |
oct | 2741771414675 |
9 | 638653562845 |
10 | 202130201021 |
11 | 787a5257811 |
12 | 33210bb3b65 |
13 | 160a3752658 |
14 | 9ad6d8d9b7 |
15 | 53d04a4deb |
hex | 2f0fe619bd |
202130201021 has 8 divisors (see below), whose sum is σ = 231010719744. Its totient is φ = 173250876240.
The previous prime is 202130201017. The next prime is 202130201047. The reversal of 202130201021 is 120102031202.
It is a happy number.
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 202130201021 - 22 = 202130201017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202130200987 and 202130201005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202130201011) 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, 99716 + ... + 643586.
It is an arithmetic number, because the mean of its divisors is an integer number (28876339968).
Almost surely, 2202130201021 is an apocalyptic number.
It is an amenable number.
202130201021 is a deficient number, since it is larger than the sum of its proper divisors (28880518723).
202130201021 is an equidigital number, since it uses as much as digits as its factorization.
202130201021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 596971.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 202130201021 its reverse (120102031202), we get a palindrome (322232232223).
The spelling of 202130201021 in words is "two hundred two billion, one hundred thirty million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •