Base | Representation |
---|---|
bin | 101111110010111110010000… |
… | …000110100101000101100001 |
3 | 1000120021222100011101010002011 |
4 | 233302332100012211011201 |
5 | 210023044113003341001 |
6 | 2023025333503552521 |
7 | 62164146410331634 |
oct | 5762762006450541 |
9 | 1016258304333064 |
10 | 210211002012001 |
11 | 60a85a9249aa71 |
12 | 1b6b03732bb741 |
13 | 903aa73bb6933 |
14 | 39ca3a40a9c1b |
15 | 194810d291d51 |
hex | bf2f901a5161 |
210211002012001 has 2 divisors, whose sum is σ = 210211002012002. Its totient is φ = 210211002012000.
The previous prime is 210211002011963. The next prime is 210211002012023. The reversal of 210211002012001 is 100210200112012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 188157872214225 + 22053129797776 = 13717065^2 + 4696076^2 .
It is a cyclic number.
It is not a de Polignac number, because 210211002012001 - 29 = 210211002011489 is a prime.
It is not a weakly prime, because it can be changed into another prime (210211002012101) 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 as a sum of consecutive naturals, namely, 105105501006000 + 105105501006001.
It is an arithmetic number, because the mean of its divisors is an integer number (105105501006001).
Almost surely, 2210211002012001 is an apocalyptic number.
It is an amenable number.
210211002012001 is a deficient number, since it is larger than the sum of its proper divisors (1).
210211002012001 is an equidigital number, since it uses as much as digits as its factorization.
210211002012001 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 210211002012001 its reverse (100210200112012), we get a palindrome (310421202124013).
The spelling of 210211002012001 in words is "two hundred ten trillion, two hundred eleven billion, two million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •