Base | Representation |
---|---|
bin | 11011100011111111000001… |
… | …101010110100001101100111 |
3 | 120220012112021222022001112102 |
4 | 123203333001222310031213 |
5 | 111342032241433042412 |
6 | 1105451430022442315 |
7 | 34350602234354306 |
oct | 3343770152641547 |
9 | 526175258261472 |
10 | 121220111221607 |
11 | 35696184645802 |
12 | 11719329b9339b |
13 | 52840134616b8 |
14 | 21d112855243d |
15 | e0332ec2b8c2 |
hex | 6e3fc1ab4367 |
121220111221607 has 2 divisors, whose sum is σ = 121220111221608. Its totient is φ = 121220111221606.
The previous prime is 121220111221591. The next prime is 121220111221633. The reversal of 121220111221607 is 706122111022121.
It is a weak prime.
It is an emirp because it is prime and its reverse (706122111022121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121220111221607 - 24 = 121220111221591 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121220111221607.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121220111221007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60610055610803 + 60610055610804.
It is an arithmetic number, because the mean of its divisors is an integer number (60610055610804).
Almost surely, 2121220111221607 is an apocalyptic number.
121220111221607 is a deficient number, since it is larger than the sum of its proper divisors (1).
121220111221607 is an equidigital number, since it uses as much as digits as its factorization.
121220111221607 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 29.
Adding to 121220111221607 its reverse (706122111022121), we get a palindrome (827342222243728).
The spelling of 121220111221607 in words is "one hundred twenty-one trillion, two hundred twenty billion, one hundred eleven million, two hundred twenty-one thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •