Base | Representation |
---|---|
bin | 11111010111101111010… |
… | …000101000101101100101 |
3 | 21122002110220100120212112 |
4 | 133113233100220231211 |
5 | 240310030414342411 |
6 | 4330205115530405 |
7 | 311515360603601 |
oct | 37275720505545 |
9 | 7562426316775 |
10 | 2155792730981 |
11 | 7612a288250a |
12 | 2a9982759a05 |
13 | 1283a0c7b7a6 |
14 | 764ab6d8501 |
15 | 3b125401b8b |
hex | 1f5ef428b65 |
2155792730981 has 2 divisors, whose sum is σ = 2155792730982. Its totient is φ = 2155792730980.
The previous prime is 2155792730941. The next prime is 2155792731013. The reversal of 2155792730981 is 1890372975512.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1346226472900 + 809566258081 = 1160270^2 + 899759^2 .
It is a cyclic number.
It is not a de Polignac number, because 2155792730981 - 210 = 2155792729957 is a prime.
It is a super-2 number, since 2×21557927309812 (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 2155792730981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2155792730941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1077896365490 + 1077896365491.
It is an arithmetic number, because the mean of its divisors is an integer number (1077896365491).
Almost surely, 22155792730981 is an apocalyptic number.
It is an amenable number.
2155792730981 is a deficient number, since it is larger than the sum of its proper divisors (1).
2155792730981 is an equidigital number, since it uses as much as digits as its factorization.
2155792730981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9525600, while the sum is 59.
The spelling of 2155792730981 in words is "two trillion, one hundred fifty-five billion, seven hundred ninety-two million, seven hundred thirty thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •