Base | Representation |
---|---|
bin | 111100010100101010011101… |
… | …1000110111000110111000001 |
3 | 2120120201101122211121120210221 |
4 | 1320221110323012320313001 |
5 | 1024021420124333023031 |
6 | 5120300453425223041 |
7 | 216522662040000331 |
oct | 17051247306706701 |
9 | 2516641584546727 |
10 | 530605546376641 |
11 | 14408160408726a |
12 | 4b616aaba91a81 |
13 | 19a0bb718611b8 |
14 | 95056345370c1 |
15 | 4152404425a11 |
hex | 1e2953b1b8dc1 |
530605546376641 has 2 divisors, whose sum is σ = 530605546376642. Its totient is φ = 530605546376640.
The previous prime is 530605546376611. The next prime is 530605546376657. The reversal of 530605546376641 is 146673645506035.
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., 514437740688400 + 16167805688241 = 22681220^2 + 4020921^2 .
It is a cyclic number.
It is not a de Polignac number, because 530605546376641 - 211 = 530605546374593 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 530605546376641.
It is not a weakly prime, because it can be changed into another prime (530605546376611) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265302773188320 + 265302773188321.
It is an arithmetic number, because the mean of its divisors is an integer number (265302773188321).
Almost surely, 2530605546376641 is an apocalyptic number.
It is an amenable number.
530605546376641 is a deficient number, since it is larger than the sum of its proper divisors (1).
530605546376641 is an equidigital number, since it uses as much as digits as its factorization.
530605546376641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 163296000, while the sum is 61.
The spelling of 530605546376641 in words is "five hundred thirty trillion, six hundred five billion, five hundred forty-six million, three hundred seventy-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •