Base | Representation |
---|---|
bin | 11100111001001001100… |
… | …001010000101001100101 |
3 | 21000210221111020120112112 |
4 | 130321021201100221211 |
5 | 230012310114041334 |
6 | 4120044022330405 |
7 | 263306514324224 |
oct | 34711141205145 |
9 | 7023844216475 |
10 | 1985508346469 |
11 | 6a605a77701a |
12 | 28097a889a05 |
13 | 11530413345b |
14 | 6c155d94cbb |
15 | 369aab2e4ce |
hex | 1ce49850a65 |
1985508346469 has 2 divisors, whose sum is σ = 1985508346470. Its totient is φ = 1985508346468.
The previous prime is 1985508346433. The next prime is 1985508346477. The reversal of 1985508346469 is 9646438055891.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1960714065025 + 24794281444 = 1400255^2 + 157462^2 .
It is a cyclic number.
It is not a de Polignac number, because 1985508346469 - 224 = 1985491569253 is a prime.
It is a super-2 number, since 2×19855083464692 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1985508346399 and 1985508346408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1985508346169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 992754173234 + 992754173235.
It is an arithmetic number, because the mean of its divisors is an integer number (992754173235).
Almost surely, 21985508346469 is an apocalyptic number.
It is an amenable number.
1985508346469 is a deficient number, since it is larger than the sum of its proper divisors (1).
1985508346469 is an equidigital number, since it uses as much as digits as its factorization.
1985508346469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 223948800, while the sum is 68.
The spelling of 1985508346469 in words is "one trillion, nine hundred eighty-five billion, five hundred eight million, three hundred forty-six thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •