Base | Representation |
---|---|
bin | 11011100011111111000001… |
… | …101010110100000101010001 |
3 | 120220012112021222022000210122 |
4 | 123203333001222310011101 |
5 | 111342032241433033243 |
6 | 1105451430022440025 |
7 | 34350602234352614 |
oct | 3343770152640521 |
9 | 526175258260718 |
10 | 121220111221073 |
11 | 35696184645367 |
12 | 11719329b93015 |
13 | 5284013461397 |
14 | 21d112855217b |
15 | e0332ec2b668 |
hex | 6e3fc1ab4151 |
121220111221073 has 2 divisors, whose sum is σ = 121220111221074. Its totient is φ = 121220111221072.
The previous prime is 121220111221031. The next prime is 121220111221103. The reversal of 121220111221073 is 370122111022121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102869657131024 + 18350454090049 = 10142468^2 + 4283743^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121220111221073 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (121220101221073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60610055610536 + 60610055610537.
It is an arithmetic number, because the mean of its divisors is an integer number (60610055610537).
Almost surely, 2121220111221073 is an apocalyptic number.
It is an amenable number.
121220111221073 is a deficient number, since it is larger than the sum of its proper divisors (1).
121220111221073 is an equidigital number, since it uses as much as digits as its factorization.
121220111221073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 672, while the sum is 26.
Adding to 121220111221073 its reverse (370122111022121), we get a palindrome (491342222243194).
The spelling of 121220111221073 in words is "one hundred twenty-one trillion, two hundred twenty billion, one hundred eleven million, two hundred twenty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •