Base | Representation |
---|---|
bin | 111000100011100010… |
… | …0000100110101111101 |
3 | 102121111011010001212222 |
4 | 1301013010010311331 |
5 | 3442213020210122 |
6 | 131443255335125 |
7 | 11526451212614 |
oct | 1610704046575 |
9 | 377434101788 |
10 | 121451335037 |
11 | 4756412666a |
12 | 1b6559814a5 |
13 | b5b6a9aab6 |
14 | 5c41dbc87b |
15 | 325c5dab42 |
hex | 1c47104d7d |
121451335037 has 2 divisors, whose sum is σ = 121451335038. Its totient is φ = 121451335036.
The previous prime is 121451334989. The next prime is 121451335039. The reversal of 121451335037 is 730533154121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73711707001 + 47739628036 = 271499^2 + 218494^2 .
It is a cyclic number.
It is not a de Polignac number, because 121451335037 - 26 = 121451334973 is a prime.
Together with 121451335039, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 121451334988 and 121451335006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121451335039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60725667518 + 60725667519.
It is an arithmetic number, because the mean of its divisors is an integer number (60725667519).
Almost surely, 2121451335037 is an apocalyptic number.
It is an amenable number.
121451335037 is a deficient number, since it is larger than the sum of its proper divisors (1).
121451335037 is an equidigital number, since it uses as much as digits as its factorization.
121451335037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 37800, while the sum is 35.
Adding to 121451335037 its reverse (730533154121), we get a palindrome (851984489158).
The spelling of 121451335037 in words is "one hundred twenty-one billion, four hundred fifty-one million, three hundred thirty-five thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •