Base | Representation |
---|---|
bin | 1001101111100001… |
… | …10001110111001101 |
3 | 111111112002222221022 |
4 | 10313300301313031 |
5 | 41203002020300 |
6 | 2223003443525 |
7 | 243421346000 |
oct | 46760616715 |
9 | 14445088838 |
10 | 5230501325 |
11 | 2244533075 |
12 | 101b8265a5 |
13 | 6548350ca |
14 | 378943537 |
15 | 2092d8285 |
hex | 137c31dcd |
5230501325 has 48 divisors (see below), whose sum is σ = 7598025600. Its totient is φ = 3570336000.
The previous prime is 5230501301. The next prime is 5230501327. The reversal of 5230501325 is 5231050325.
It is not a de Polignac number, because 5230501325 - 220 = 5229452749 is a prime.
It is a super-2 number, since 2×52305013252 = 54716288221653511250, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5230501294 and 5230501303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5230501327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2065310 + ... + 2067840.
It is an arithmetic number, because the mean of its divisors is an integer number (158292200).
Almost surely, 25230501325 is an apocalyptic number.
It is an amenable number.
5230501325 is a deficient number, since it is larger than the sum of its proper divisors (2367524275).
5230501325 is a wasteful number, since it uses less digits than its factorization.
5230501325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2803 (or 2784 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 26.
The square root of 5230501325 is about 72322.2049235226. The cubic root of 5230501325 is about 1735.8589733253.
The spelling of 5230501325 in words is "five billion, two hundred thirty million, five hundred one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •