Base | Representation |
---|---|
bin | 111000100000001110… |
… | …0111111010000001111 |
3 | 102121012102102021020101 |
4 | 1301000130333100033 |
5 | 3442001122101411 |
6 | 131424254231531 |
7 | 11523633411454 |
oct | 1610034772017 |
9 | 377172367211 |
10 | 121340425231 |
11 | 47507563473 |
12 | 1b6247b55a7 |
13 | b599b075ac |
14 | 5c3138b82b |
15 | 32529cd8c1 |
hex | 1c4073f40f |
121340425231 has 2 divisors, whose sum is σ = 121340425232. Its totient is φ = 121340425230.
The previous prime is 121340425189. The next prime is 121340425259. The reversal of 121340425231 is 132524043121.
It is an a-pointer prime, because the next prime (121340425259) can be obtained adding 121340425231 to its sum of digits (28).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121340425231 - 213 = 121340417039 is a prime.
It is a super-2 number, since 2×1213404252312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 121340425231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121340425931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60670212615 + 60670212616.
It is an arithmetic number, because the mean of its divisors is an integer number (60670212616).
Almost surely, 2121340425231 is an apocalyptic number.
121340425231 is a deficient number, since it is larger than the sum of its proper divisors (1).
121340425231 is an equidigital number, since it uses as much as digits as its factorization.
121340425231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 121340425231 its reverse (132524043121), we get a palindrome (253864468352).
The spelling of 121340425231 in words is "one hundred twenty-one billion, three hundred forty million, four hundred twenty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •