Base | Representation |
---|---|
bin | 11100101011001110011… |
… | …100000010001010110101 |
3 | 20222101100121102111222121 |
4 | 130223032130002022311 |
5 | 224241200432230411 |
6 | 4105132334555541 |
7 | 262240163455003 |
oct | 34531634021265 |
9 | 6871317374877 |
10 | 1970558476981 |
11 | 69a788984886 |
12 | 279aa8068bb1 |
13 | 113a90aba033 |
14 | 6b53869da73 |
15 | 363d341d571 |
hex | 1cace7022b5 |
1970558476981 has 2 divisors, whose sum is σ = 1970558476982. Its totient is φ = 1970558476980.
The previous prime is 1970558476967. The next prime is 1970558477033. The reversal of 1970558476981 is 1896748550791.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1879821976356 + 90736500625 = 1371066^2 + 301225^2 .
It is a cyclic number.
It is not a de Polignac number, because 1970558476981 - 235 = 1936198738613 is a prime.
It is a super-2 number, since 2×19705584769812 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1970558476981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1970558473981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 985279238490 + 985279238491.
It is an arithmetic number, because the mean of its divisors is an integer number (985279238491).
Almost surely, 21970558476981 is an apocalyptic number.
It is an amenable number.
1970558476981 is a deficient number, since it is larger than the sum of its proper divisors (1).
1970558476981 is an equidigital number, since it uses as much as digits as its factorization.
1970558476981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 152409600, while the sum is 70.
The spelling of 1970558476981 in words is "one trillion, nine hundred seventy billion, five hundred fifty-eight million, four hundred seventy-six thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.804 sec. • engine limits •