Base | Representation |
---|---|
bin | 111000100011000011… |
… | …0100101001001100101 |
3 | 102121110000210001120201 |
4 | 1301012012211021211 |
5 | 3442144403330222 |
6 | 131441522030501 |
7 | 11526164202025 |
oct | 1610606451145 |
9 | 377400701521 |
10 | 121435214437 |
11 | 47556015a59 |
12 | 1b6504a8431 |
13 | b5b3645394 |
14 | 5c3dbc3a85 |
15 | 325aea4427 |
hex | 1c461a5265 |
121435214437 has 2 divisors, whose sum is σ = 121435214438. Its totient is φ = 121435214436.
The previous prime is 121435214431. The next prime is 121435214441. The reversal of 121435214437 is 734412534121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91832635521 + 29602578916 = 303039^2 + 172054^2 .
It is a cyclic number.
It is not a de Polignac number, because 121435214437 - 231 = 119287730789 is a prime.
It is a super-2 number, since 2×1214352144372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121435214396 and 121435214405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121435214431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60717607218 + 60717607219.
It is an arithmetic number, because the mean of its divisors is an integer number (60717607219).
Almost surely, 2121435214437 is an apocalyptic number.
It is an amenable number.
121435214437 is a deficient number, since it is larger than the sum of its proper divisors (1).
121435214437 is an equidigital number, since it uses as much as digits as its factorization.
121435214437 is an evil number, because the sum of its binary digits is even.
The product of its digits is 80640, while the sum is 37.
Adding to 121435214437 its reverse (734412534121), we get a palindrome (855847748558).
The spelling of 121435214437 in words is "one hundred twenty-one billion, four hundred thirty-five million, two hundred fourteen thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •