Base | Representation |
---|---|
bin | 11011100001010111010011… |
… | …101001011111111111010001 |
3 | 120212120022110101212112001202 |
4 | 123201113103221133333101 |
5 | 111331104432201140311 |
6 | 1105233004113440545 |
7 | 34331565431312612 |
oct | 3341272351377721 |
9 | 525508411775052 |
10 | 121040024240081 |
11 | 356268711a4071 |
12 | 116aa44b270155 |
13 | 52700437b40bb |
14 | 21c6522d93c09 |
15 | ded7dea90e3b |
hex | 6e15d3a5ffd1 |
121040024240081 has 2 divisors, whose sum is σ = 121040024240082. Its totient is φ = 121040024240080.
The previous prime is 121040024239933. The next prime is 121040024240089. The reversal of 121040024240081 is 180042420040121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 74484511854481 + 46555512385600 = 8630441^2 + 6823160^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121040024240081 is a prime.
It is a super-2 number, since 2×1210400242400812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (121040024240089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60520012120040 + 60520012120041.
It is an arithmetic number, because the mean of its divisors is an integer number (60520012120041).
Almost surely, 2121040024240081 is an apocalyptic number.
It is an amenable number.
121040024240081 is a deficient number, since it is larger than the sum of its proper divisors (1).
121040024240081 is an equidigital number, since it uses as much as digits as its factorization.
121040024240081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4096, while the sum is 29.
The spelling of 121040024240081 in words is "one hundred twenty-one trillion, forty billion, twenty-four million, two hundred forty thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •