Base | Representation |
---|---|
bin | 111100010001101110000110… |
… | …0011100010100110111110001 |
3 | 2120112021201112211222211221012 |
4 | 1320203130030130110313301 |
5 | 1023443303210323311200 |
6 | 5115350554343440305 |
7 | 216451521644063564 |
oct | 17043341434246761 |
9 | 2515251484884835 |
10 | 530201036541425 |
11 | 143a35aa68a6a27 |
12 | 4b57061a456095 |
13 | 199ac987ab4812 |
14 | 94cdc1d4284db |
15 | 4146b2bb49a35 |
hex | 1e2370c714df1 |
530201036541425 has 12 divisors (see below), whose sum is σ = 657542686479360. Its totient is φ = 424100570415120.
The previous prime is 530201036541313. The next prime is 530201036541457. The reversal of 530201036541425 is 524145630102035.
It is not a de Polignac number, because 530201036541425 - 210 = 530201036540401 is a prime.
It is a super-2 number, since 2×5302010365414252 (a number of 30 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1506290957 + ... + 1506642906.
It is an arithmetic number, because the mean of its divisors is an integer number (54795223873280).
Almost surely, 2530201036541425 is an apocalyptic number.
It is an amenable number.
530201036541425 is a deficient number, since it is larger than the sum of its proper divisors (127341649937935).
530201036541425 is a wasteful number, since it uses less digits than its factorization.
530201036541425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3012940912 (or 3012940907 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 41.
The spelling of 530201036541425 in words is "five hundred thirty trillion, two hundred one billion, thirty-six million, five hundred forty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •