Base | Representation |
---|---|
bin | 1001100100111101001001… |
… | …0110100010011111011001 |
3 | 1101021201001020012221211001 |
4 | 2121033102112202133121 |
5 | 2340012422423410142 |
6 | 34221350411505001 |
7 | 2134542312556534 |
oct | 231172226423731 |
9 | 41251036187731 |
10 | 10530493966297 |
11 | 339aa59350758 |
12 | 1220a69158161 |
13 | 5b5037ac0026 |
14 | 285970221a1b |
15 | 133dc7c255b7 |
hex | 993d25a27d9 |
10530493966297 has 2 divisors, whose sum is σ = 10530493966298. Its totient is φ = 10530493966296.
The previous prime is 10530493966271. The next prime is 10530493966331. The reversal of 10530493966297 is 79266939403501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8697992983696 + 1832500982601 = 2949236^2 + 1353699^2 .
It is a cyclic number.
It is not a de Polignac number, because 10530493966297 - 27 = 10530493966169 is a prime.
It is a super-2 number, since 2×105304939662972 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10530493961297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5265246983148 + 5265246983149.
It is an arithmetic number, because the mean of its divisors is an integer number (5265246983149).
Almost surely, 210530493966297 is an apocalyptic number.
It is an amenable number.
10530493966297 is a deficient number, since it is larger than the sum of its proper divisors (1).
10530493966297 is an equidigital number, since it uses as much as digits as its factorization.
10530493966297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 66134880, while the sum is 64.
The spelling of 10530493966297 in words is "ten trillion, five hundred thirty billion, four hundred ninety-three million, nine hundred sixty-six thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •