Base | Representation |
---|---|
bin | 111000110011011100… |
… | …0000100100000101001 |
3 | 102122212100102001022212 |
4 | 1301212320010200221 |
5 | 3444311133340412 |
6 | 132012243054505 |
7 | 11545621615004 |
oct | 1614670044051 |
9 | 378770361285 |
10 | 121985058857 |
11 | 47808427232 |
12 | 1b784671435 |
13 | b67052cacc |
14 | 5c92c3253b |
15 | 328e3b6222 |
hex | 1c66e04829 |
121985058857 has 2 divisors, whose sum is σ = 121985058858. Its totient is φ = 121985058856.
The previous prime is 121985058847. The next prime is 121985058893. The reversal of 121985058857 is 758850589121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86603072656 + 35381986201 = 294284^2 + 188101^2 .
It is an emirp because it is prime and its reverse (758850589121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121985058857 - 216 = 121984993321 is a prime.
It is a super-3 number, since 3×1219850588573 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121985058796 and 121985058805.
It is not a weakly prime, because it can be changed into another prime (121985058827) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60992529428 + 60992529429.
It is an arithmetic number, because the mean of its divisors is an integer number (60992529429).
Almost surely, 2121985058857 is an apocalyptic number.
It is an amenable number.
121985058857 is a deficient number, since it is larger than the sum of its proper divisors (1).
121985058857 is an equidigital number, since it uses as much as digits as its factorization.
121985058857 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064000, while the sum is 59.
The spelling of 121985058857 in words is "one hundred twenty-one billion, nine hundred eighty-five million, fifty-eight thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •