Base | Representation |
---|---|
bin | 11011100011110101110010… |
… | …111110010101101111001001 |
3 | 120220011120201022110220001221 |
4 | 123203311302332111233021 |
5 | 111341401442424130001 |
6 | 1105443110404242041 |
7 | 34350101530043443 |
oct | 3343656276255711 |
9 | 526146638426057 |
10 | 121210201005001 |
11 | 35691a59584349 |
12 | 117174230a0321 |
13 | 52830c424b6c4 |
14 | 21d08682c1493 |
15 | e02e4eba61a1 |
hex | 6e3d72f95bc9 |
121210201005001 has 2 divisors, whose sum is σ = 121210201005002. Its totient is φ = 121210201005000.
The previous prime is 121210201004881. The next prime is 121210201005013. The reversal of 121210201005001 is 100500102012121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121191497707401 + 18703297600 = 11008701^2 + 136760^2 .
It is a cyclic number.
It is not a de Polignac number, because 121210201005001 - 27 = 121210201004873 is a prime.
It is not a weakly prime, because it can be changed into another prime (121210201005031) 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, 60605100502500 + 60605100502501.
It is an arithmetic number, because the mean of its divisors is an integer number (60605100502501).
Almost surely, 2121210201005001 is an apocalyptic number.
It is an amenable number.
121210201005001 is a deficient number, since it is larger than the sum of its proper divisors (1).
121210201005001 is an equidigital number, since it uses as much as digits as its factorization.
121210201005001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40, while the sum is 16.
Adding to 121210201005001 its reverse (100500102012121), we get a palindrome (221710303017122).
The spelling of 121210201005001 in words is "one hundred twenty-one trillion, two hundred ten billion, two hundred one million, five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •