Base | Representation |
---|---|
bin | 1111011011101010111… |
… | …01000001110101111101 |
3 | 1212200200010210020010020 |
4 | 13231311131001311331 |
5 | 32141423342141110 |
6 | 1043332202202353 |
7 | 53211061364634 |
oct | 7556535016575 |
9 | 1780603706106 |
10 | 530251521405 |
11 | 194973184261 |
12 | 869241b33b9 |
13 | 3b005668bb8 |
14 | 1b942c2251b |
15 | dbd6891d70 |
hex | 7b75741d7d |
530251521405 has 32 divisors (see below), whose sum is σ = 899149248000. Its totient is φ = 265916347392.
The previous prime is 530251521391. The next prime is 530251521431. The reversal of 530251521405 is 504125152035.
It is not a de Polignac number, because 530251521405 - 212 = 530251517309 is a prime.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 700005 + ... + 1245194.
It is an arithmetic number, because the mean of its divisors is an integer number (28098414000).
Almost surely, 2530251521405 is an apocalyptic number.
It is an amenable number.
530251521405 is a deficient number, since it is larger than the sum of its proper divisors (368897726595).
530251521405 is a wasteful number, since it uses less digits than its factorization.
530251521405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1946293.
The product of its (nonzero) digits is 30000, while the sum is 33.
The spelling of 530251521405 in words is "five hundred thirty billion, two hundred fifty-one million, five hundred twenty-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •