Base | Representation |
---|---|
bin | 1001010100000101111… |
… | …11000010011101010101 |
3 | 1010121001002202200212201 |
4 | 10222002333002131111 |
5 | 20220402414040000 |
6 | 403003441244501 |
7 | 32056343555662 |
oct | 4520277023525 |
9 | 1117032680781 |
10 | 320025143125 |
11 | 1137a3939766 |
12 | 52033933731 |
13 | 2424179a91c |
14 | 116bc8d0a69 |
15 | 84d074496a |
hex | 4a82fc2755 |
320025143125 has 40 divisors (see below), whose sum is σ = 404888113080. Its totient is φ = 252835968000.
The previous prime is 320025143117. The next prime is 320025143149. The reversal of 320025143125 is 521341520023.
It can be written as a sum of positive squares in 20 ways, for example, as 298533289924 + 21491853201 = 546382^2 + 146601^2 .
It is not a de Polignac number, because 320025143125 - 23 = 320025143117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 320025143093 and 320025143102.
It is a congruent number.
It is an unprimeable number.
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 39 ways as a sum of consecutive naturals, for example, 53007607 + ... + 53013643.
It is an arithmetic number, because the mean of its divisors is an integer number (10122202827).
Almost surely, 2320025143125 is an apocalyptic number.
It is an amenable number.
320025143125 is a deficient number, since it is larger than the sum of its proper divisors (84862969955).
320025143125 is an frugal number, since it uses more digits than its factorization.
320025143125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7099 (or 7084 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 320025143125 its reverse (521341520023), we get a palindrome (841366663148).
The spelling of 320025143125 in words is "three hundred twenty billion, twenty-five million, one hundred forty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •