Base | Representation |
---|---|
bin | 11011101111011110110110… |
… | …101100111011000011011001 |
3 | 121000000001122200222220011001 |
4 | 123233132312230323003121 |
5 | 111443003343002111001 |
6 | 1111254413533105001 |
7 | 34461642345416422 |
oct | 3357366654730331 |
9 | 530001580886131 |
10 | 122010201207001 |
11 | 35970265866888 |
12 | 11826489628161 |
13 | 5310688268cb3 |
14 | 221b47a69a649 |
15 | e18b72ed8001 |
hex | 6ef7b6b3b0d9 |
122010201207001 has 2 divisors, whose sum is σ = 122010201207002. Its totient is φ = 122010201207000.
The previous prime is 122010201206987. The next prime is 122010201207019. The reversal of 122010201207001 is 100702102010221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 121340160733401 + 670040473600 = 11015451^2 + 818560^2 .
It is a cyclic number.
It is not a de Polignac number, because 122010201207001 - 29 = 122010201206489 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122010201207001.
It is not a weakly prime, because it can be changed into another prime (122010201207061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61005100603500 + 61005100603501.
It is an arithmetic number, because the mean of its divisors is an integer number (61005100603501).
Almost surely, 2122010201207001 is an apocalyptic number.
It is an amenable number.
122010201207001 is a deficient number, since it is larger than the sum of its proper divisors (1).
122010201207001 is an equidigital number, since it uses as much as digits as its factorization.
122010201207001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 19.
Adding to 122010201207001 its reverse (100702102010221), we get a palindrome (222712303217222).
The spelling of 122010201207001 in words is "one hundred twenty-two trillion, ten billion, two hundred one million, two hundred seven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •