Base | Representation |
---|---|
bin | 101111110001101001100000… |
… | …100100010111100001110001 |
3 | 1000112222021110210020012022111 |
4 | 233301221200210113201301 |
5 | 210020101240102414301 |
6 | 2022515444453405321 |
7 | 62154445505602462 |
oct | 5761514044274161 |
9 | 1015867423205274 |
10 | 210120010201201 |
11 | 60a50439a39831 |
12 | 1b6967ba339841 |
13 | 9032302763a79 |
14 | 39c5c11592d69 |
15 | 1945a84d00551 |
hex | bf1a60917871 |
210120010201201 has 2 divisors, whose sum is σ = 210120010201202. Its totient is φ = 210120010201200.
The previous prime is 210120010201159. The next prime is 210120010201229. The reversal of 210120010201201 is 102102010021012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126774065841201 + 83345944360000 = 11259399^2 + 9129400^2 .
It is a cyclic number.
It is not a de Polignac number, because 210120010201201 - 217 = 210120010070129 is a prime.
It is not a weakly prime, because it can be changed into another prime (210120010207201) 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, 105060005100600 + 105060005100601.
It is an arithmetic number, because the mean of its divisors is an integer number (105060005100601).
Almost surely, 2210120010201201 is an apocalyptic number.
It is an amenable number.
210120010201201 is a deficient number, since it is larger than the sum of its proper divisors (1).
210120010201201 is an equidigital number, since it uses as much as digits as its factorization.
210120010201201 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 210120010201201 its reverse (102102010021012), we get a palindrome (312222020222213).
The spelling of 210120010201201 in words is "two hundred ten trillion, one hundred twenty billion, ten million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •