Base | Representation |
---|---|
bin | 101111101111111011101101… |
… | …010011001110010001010001 |
3 | 1000112120000011021100200210211 |
4 | 233233323231103032101101 |
5 | 210011133311211210001 |
6 | 2022345345530324121 |
7 | 62143103052321556 |
oct | 5757735523162121 |
9 | 1015500137320724 |
10 | 210002112210001 |
11 | 60a05439664a71 |
12 | 1b677996589641 |
13 | 9024163bbb9b7 |
14 | 39c022949aa2d |
15 | 194298465c351 |
hex | befeed4ce451 |
210002112210001 has 2 divisors, whose sum is σ = 210002112210002. Its totient is φ = 210002112210000.
The previous prime is 210002112209917. The next prime is 210002112210013. The reversal of 210002112210001 is 100012211200012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108701893040400 + 101300219169601 = 10426020^2 + 10064801^2 .
It is a cyclic number.
It is not a de Polignac number, because 210002112210001 - 221 = 210002110112849 is a prime.
It is not a weakly prime, because it can be changed into another prime (210002112210901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105001056105000 + 105001056105001.
It is an arithmetic number, because the mean of its divisors is an integer number (105001056105001).
Almost surely, 2210002112210001 is an apocalyptic number.
It is an amenable number.
210002112210001 is a deficient number, since it is larger than the sum of its proper divisors (1).
210002112210001 is an equidigital number, since it uses as much as digits as its factorization.
210002112210001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210002112210001 its reverse (100012211200012), we get a palindrome (310014323410013).
The spelling of 210002112210001 in words is "two hundred ten trillion, two billion, one hundred twelve million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •