Base | Representation |
---|---|
bin | 11011100101011100001111… |
… | …011011010100111100000001 |
3 | 120220120002122100001102201222 |
4 | 123211130033123110330001 |
5 | 111400202232202011001 |
6 | 1110005421441204425 |
7 | 34361044440252245 |
oct | 3345341733247401 |
9 | 526502570042658 |
10 | 121320200032001 |
11 | 3572467611a423 |
12 | 11734801630715 |
13 | 52905a4497769 |
14 | 21d5d012d0425 |
15 | e05c3bb5a61b |
hex | 6e570f6d4f01 |
121320200032001 has 2 divisors, whose sum is σ = 121320200032002. Its totient is φ = 121320200032000.
The previous prime is 121320200031941. The next prime is 121320200032007. The reversal of 121320200032001 is 100230002023121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119821593153025 + 1498606878976 = 10946305^2 + 1224176^2 .
It is an emirp because it is prime and its reverse (100230002023121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121320200032001 - 26 = 121320200031937 is a prime.
It is not a weakly prime, because it can be changed into another prime (121320200032007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60660100016000 + 60660100016001.
It is an arithmetic number, because the mean of its divisors is an integer number (60660100016001).
Almost surely, 2121320200032001 is an apocalyptic number.
It is an amenable number.
121320200032001 is a deficient number, since it is larger than the sum of its proper divisors (1).
121320200032001 is an equidigital number, since it uses as much as digits as its factorization.
121320200032001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 121320200032001 its reverse (100230002023121), we get a palindrome (221550202055122).
The spelling of 121320200032001 in words is "one hundred twenty-one trillion, three hundred twenty billion, two hundred million, thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •