Base | Representation |
---|---|
bin | 11011100100010101011001… |
… | …010111011001001011100101 |
3 | 120220021211021221221111000021 |
4 | 123210111121113121023211 |
5 | 111342430440030302321 |
6 | 1105510441312115141 |
7 | 34352412411112342 |
oct | 3344253127311345 |
9 | 526254257844007 |
10 | 121244131103461 |
11 | 356a53901a8533 |
12 | 11721b12235ab1 |
13 | 52863708cc442 |
14 | 21d23666857c9 |
15 | e03c88848941 |
hex | 6e45595d92e5 |
121244131103461 has 2 divisors, whose sum is σ = 121244131103462. Its totient is φ = 121244131103460.
The previous prime is 121244131103413. The next prime is 121244131103467. The reversal of 121244131103461 is 164301131442121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120366900304225 + 877230799236 = 10971185^2 + 936606^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121244131103461 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121244131103467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60622065551730 + 60622065551731.
It is an arithmetic number, because the mean of its divisors is an integer number (60622065551731).
Almost surely, 2121244131103461 is an apocalyptic number.
It is an amenable number.
121244131103461 is a deficient number, since it is larger than the sum of its proper divisors (1).
121244131103461 is an equidigital number, since it uses as much as digits as its factorization.
121244131103461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 34.
Adding to 121244131103461 its reverse (164301131442121), we get a palindrome (285545262545582).
The spelling of 121244131103461 in words is "one hundred twenty-one trillion, two hundred forty-four billion, one hundred thirty-one million, one hundred three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •