Base | Representation |
---|---|
bin | 111000011000001010… |
… | …1000001001111101101 |
3 | 102120111120101012110022 |
4 | 1300300111001033231 |
5 | 3440422343311111 |
6 | 131341352051525 |
7 | 11514140114444 |
oct | 1606025011755 |
9 | 376446335408 |
10 | 121069900781 |
11 | 47388891445 |
12 | 1b56a093ba5 |
13 | b555a59b5b |
14 | 5c0748bd5b |
15 | 3238d932db |
hex | 1c305413ed |
121069900781 has 2 divisors, whose sum is σ = 121069900782. Its totient is φ = 121069900780.
The previous prime is 121069900751. The next prime is 121069900799. The reversal of 121069900781 is 187009960121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83136495556 + 37933405225 = 288334^2 + 194765^2 .
It is an emirp because it is prime and its reverse (187009960121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121069900781 - 26 = 121069900717 is a prime.
It is a super-2 number, since 2×1210699007812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121069900751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60534950390 + 60534950391.
It is an arithmetic number, because the mean of its divisors is an integer number (60534950391).
Almost surely, 2121069900781 is an apocalyptic number.
It is an amenable number.
121069900781 is a deficient number, since it is larger than the sum of its proper divisors (1).
121069900781 is an equidigital number, since it uses as much as digits as its factorization.
121069900781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 44.
The spelling of 121069900781 in words is "one hundred twenty-one billion, sixty-nine million, nine hundred thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •