Base | Representation |
---|---|
bin | 111100010001000000101010… |
… | …0001001001010111010100101 |
3 | 2120111221101200020112200221001 |
4 | 1320202001110021022322211 |
5 | 1023440203334014403103 |
6 | 5115234055421353301 |
7 | 216441465536454232 |
oct | 17042012411127245 |
9 | 2514841606480831 |
10 | 530103455231653 |
11 | 1439a8681789676 |
12 | 4b555726708831 |
13 | 199a3706405c34 |
14 | 94c92036d0789 |
15 | 4144319e2901d |
hex | 1e2205424aea5 |
530103455231653 has 2 divisors, whose sum is σ = 530103455231654. Its totient is φ = 530103455231652.
The previous prime is 530103455231629. The next prime is 530103455231671. The reversal of 530103455231653 is 356132554301035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 483955033044484 + 46148422187169 = 21998978^2 + 6793263^2 .
It is a cyclic number.
It is not a de Polignac number, because 530103455231653 - 25 = 530103455231621 is a prime.
It is a super-2 number, since 2×5301034552316532 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530103455231353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265051727615826 + 265051727615827.
It is an arithmetic number, because the mean of its divisors is an integer number (265051727615827).
Almost surely, 2530103455231653 is an apocalyptic number.
It is an amenable number.
530103455231653 is a deficient number, since it is larger than the sum of its proper divisors (1).
530103455231653 is an equidigital number, since it uses as much as digits as its factorization.
530103455231653 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2430000, while the sum is 46.
The spelling of 530103455231653 in words is "five hundred thirty trillion, one hundred three billion, four hundred fifty-five million, two hundred thirty-one thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •