Base | Representation |
---|---|
bin | 10111010100001011110… |
… | …00011010100010101001 |
3 | 2211120210201221102101022 |
4 | 23222011320122202221 |
5 | 101111133134404221 |
6 | 1412005213102225 |
7 | 111610153200635 |
oct | 13520570324251 |
9 | 2746721842338 |
10 | 801110075561 |
11 | 289826830a14 |
12 | 10b316187975 |
13 | 5a70cc47413 |
14 | 2aab9967dc5 |
15 | 15c8a9b84ab |
hex | ba85e1a8a9 |
801110075561 has 2 divisors, whose sum is σ = 801110075562. Its totient is φ = 801110075560.
The previous prime is 801110075473. The next prime is 801110075569. The reversal of 801110075561 is 165570011108.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 579851790400 + 221258285161 = 761480^2 + 470381^2 .
It is a cyclic number.
It is not a de Polignac number, because 801110075561 - 234 = 783930206377 is a prime.
It is a super-2 number, since 2×8011100755612 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (801110075569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 400555037780 + 400555037781.
It is an arithmetic number, because the mean of its divisors is an integer number (400555037781).
Almost surely, 2801110075561 is an apocalyptic number.
It is an amenable number.
801110075561 is a deficient number, since it is larger than the sum of its proper divisors (1).
801110075561 is an equidigital number, since it uses as much as digits as its factorization.
801110075561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8400, while the sum is 35.
Adding to 801110075561 its reverse (165570011108), we get a palindrome (966680086669).
The spelling of 801110075561 in words is "eight hundred one billion, one hundred ten million, seventy-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •