Base | Representation |
---|---|
bin | 111000011100100001… |
… | …0011011001111101001 |
3 | 102120212202022220101002 |
4 | 1300321002123033221 |
5 | 3441222300141411 |
6 | 131404052004345 |
7 | 11520563116352 |
oct | 1607102331751 |
9 | 376782286332 |
10 | 121216021481 |
11 | 47453314055 |
12 | 1b5ab0006b5 |
13 | b57a0cb0c9 |
14 | 5c1ca46d29 |
15 | 3246b0833b |
hex | 1c3909b3e9 |
121216021481 has 2 divisors, whose sum is σ = 121216021482. Its totient is φ = 121216021480.
The previous prime is 121216021439. The next prime is 121216021483. The reversal of 121216021481 is 184120612121.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91390731481 + 29825290000 = 302309^2 + 172700^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121216021481 is a prime.
It is a super-2 number, since 2×1212160214812 (a number of 23 digits) contains 22 as substring.
Together with 121216021483, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (121216021483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60608010740 + 60608010741.
It is an arithmetic number, because the mean of its divisors is an integer number (60608010741).
Almost surely, 2121216021481 is an apocalyptic number.
It is an amenable number.
121216021481 is a deficient number, since it is larger than the sum of its proper divisors (1).
121216021481 is an equidigital number, since it uses as much as digits as its factorization.
121216021481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 29.
The spelling of 121216021481 in words is "one hundred twenty-one billion, two hundred sixteen million, twenty-one thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •