Base | Representation |
---|---|
bin | 101111101111111011100110… |
… | …101011000100100011000001 |
3 | 1000112112222212112010201100011 |
4 | 233233323212223010203001 |
5 | 210011133044230133441 |
6 | 2022345330515224521 |
7 | 62143100232246001 |
oct | 5757734653044301 |
9 | 1015488775121304 |
10 | 210002001021121 |
11 | 60a05391921131 |
12 | 1b6779652a8141 |
13 | 9024146b5b46a |
14 | 39c02187d6001 |
15 | 19429799e7581 |
hex | befee6ac48c1 |
210002001021121 has 4 divisors (see below), whose sum is σ = 219132522804672. Its totient is φ = 200871479237572.
The previous prime is 210002001021119. The next prime is 210002001021143. The reversal of 210002001021121 is 121120100200012.
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.
It is a cyclic number.
It is not a de Polignac number, because 210002001021121 - 21 = 210002001021119 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210002001021151) 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, 4565260891741 + ... + 4565260891786.
It is an arithmetic number, because the mean of its divisors is an integer number (54783130701168).
Almost surely, 2210002001021121 is an apocalyptic number.
It is an amenable number.
210002001021121 is a deficient number, since it is larger than the sum of its proper divisors (9130521783551).
210002001021121 is an equidigital number, since it uses as much as digits as its factorization.
210002001021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9130521783550.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210002001021121 its reverse (121120100200012), we get a palindrome (331122101221133).
The spelling of 210002001021121 in words is "two hundred ten trillion, two billion, one million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •