Base | Representation |
---|---|
bin | 1101001011001001100101111… |
… | …0000000001110101000010001 |
3 | 11111120102102001122212200012122 |
4 | 3102302121132000032220101 |
5 | 1433002314211022400031 |
6 | 13043402150450304025 |
7 | 366161242512502001 |
oct | 32262313600165021 |
9 | 4446372048780178 |
10 | 927053088090641 |
11 | 24942a009004016 |
12 | 87b85123588015 |
13 | 30a389672a8b75 |
14 | 124cd874a62001 |
15 | 7229ba1aeb47b |
hex | 34b265e00ea11 |
927053088090641 has 2 divisors, whose sum is σ = 927053088090642. Its totient is φ = 927053088090640.
The previous prime is 927053088090601. The next prime is 927053088090659. The reversal of 927053088090641 is 146090880350729.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 554087345683600 + 372965742407041 = 23539060^2 + 19312321^2 .
It is a cyclic number.
It is not a de Polignac number, because 927053088090641 - 222 = 927053083896337 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (927053088090601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 463526544045320 + 463526544045321.
It is an arithmetic number, because the mean of its divisors is an integer number (463526544045321).
It is a 1-persistent number, because it is pandigital, but 2⋅927053088090641 = 1854106176181282 is not.
Almost surely, 2927053088090641 is an apocalyptic number.
It is an amenable number.
927053088090641 is a deficient number, since it is larger than the sum of its proper divisors (1).
927053088090641 is an equidigital number, since it uses as much as digits as its factorization.
927053088090641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26127360, while the sum is 62.
The spelling of 927053088090641 in words is "nine hundred twenty-seven trillion, fifty-three billion, eighty-eight million, ninety thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •