Base | Representation |
---|---|
bin | 101101101101001111100101… |
… | …110100111010111011010001 |
3 | 222100202102212202210210022211 |
4 | 231231033211310322323101 |
5 | 202322012414303210001 |
6 | 1551311511420232121 |
7 | 60225205662011506 |
oct | 5555174564727321 |
9 | 870672782723284 |
10 | 201021210210001 |
11 | 59062686607a15 |
12 | 1a66731069b641 |
13 | 88222ac88cb2c |
14 | 378d69ad7d4ad |
15 | 1839052927351 |
hex | b6d3e5d3aed1 |
201021210210001 has 2 divisors, whose sum is σ = 201021210210002. Its totient is φ = 201021210210000.
The previous prime is 201021210209977. The next prime is 201021210210017. The reversal of 201021210210001 is 100012012120102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127349870803600 + 73671339406401 = 11284940^2 + 8583201^2 .
It is a cyclic number.
It is not a de Polignac number, because 201021210210001 - 213 = 201021210201809 is a prime.
It is not a weakly prime, because it can be changed into another prime (201021210210901) 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, 100510605105000 + 100510605105001.
It is an arithmetic number, because the mean of its divisors is an integer number (100510605105001).
Almost surely, 2201021210210001 is an apocalyptic number.
It is an amenable number.
201021210210001 is a deficient number, since it is larger than the sum of its proper divisors (1).
201021210210001 is an equidigital number, since it uses as much as digits as its factorization.
201021210210001 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 201021210210001 its reverse (100012012120102), we get a palindrome (301033222330103).
The spelling of 201021210210001 in words is "two hundred one trillion, twenty-one billion, two hundred ten million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •