Base | Representation |
---|---|
bin | 11100011000011011… |
… | …001000101011111101 |
3 | 2220122211012220202102 |
4 | 130120123020223331 |
5 | 444402440201400 |
6 | 21555543034445 |
7 | 2126121203522 |
oct | 343033105375 |
9 | 86584186672 |
10 | 30474537725 |
11 | 11a1909a275 |
12 | 5aa5a3ba25 |
13 | 2b487a3758 |
14 | 1691493149 |
15 | bd56129d5 |
hex | 7186c8afd |
30474537725 has 6 divisors (see below), whose sum is σ = 37788426810. Its totient is φ = 24379630160.
The previous prime is 30474537719. The next prime is 30474537727. The reversal of 30474537725 is 52773547403.
It can be written as a sum of positive squares in 3 ways, for example, as 163379524 + 30311158201 = 12782^2 + 174101^2 .
It is a de Polignac number, because none of the positive numbers 2k-30474537725 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30474537725.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30474537727) 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 5 ways as a sum of consecutive naturals, for example, 609490730 + ... + 609490779.
It is an arithmetic number, because the mean of its divisors is an integer number (6298071135).
Almost surely, 230474537725 is an apocalyptic number.
It is an amenable number.
30474537725 is a deficient number, since it is larger than the sum of its proper divisors (7313889085).
30474537725 is a wasteful number, since it uses less digits than its factorization.
30474537725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1218981519 (or 1218981514 counting only the distinct ones).
The product of its (nonzero) digits is 2469600, while the sum is 47.
The spelling of 30474537725 in words is "thirty billion, four hundred seventy-four million, five hundred thirty-seven thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •