Base | Representation |
---|---|
bin | 1001011101111100010… |
… | …11000010010001010101 |
3 | 1011002200122000022021101 |
4 | 10232332023002101111 |
5 | 20312220124024000 |
6 | 405240300550101 |
7 | 32334363551212 |
oct | 4567613022125 |
9 | 1132618008241 |
10 | 325313111125 |
11 | 115a67852352 |
12 | 5306a852331 |
13 | 248a51a3882 |
14 | 11a60d12b09 |
15 | 86deacee6a |
hex | 4bbe2c2455 |
325313111125 has 32 divisors (see below), whose sum is σ = 416191426560. Its totient is φ = 253720720000.
The previous prime is 325313111119. The next prime is 325313111131. The reversal of 325313111125 is 521111313523.
It is an interprime number because it is at equal distance from previous prime (325313111119) and next prime (325313111131).
It is not a de Polignac number, because 325313111125 - 25 = 325313111093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 325313111093 and 325313111102.
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 31 ways as a sum of consecutive naturals, for example, 7352820 + ... + 7396930.
It is an arithmetic number, because the mean of its divisors is an integer number (13005982080).
Almost surely, 2325313111125 is an apocalyptic number.
It is an amenable number.
325313111125 is a deficient number, since it is larger than the sum of its proper divisors (90878315435).
325313111125 is a wasteful number, since it uses less digits than its factorization.
325313111125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45606 (or 45596 counting only the distinct ones).
The product of its digits is 2700, while the sum is 28.
Adding to 325313111125 its reverse (521111313523), we get a palindrome (846424424648).
The spelling of 325313111125 in words is "three hundred twenty-five billion, three hundred thirteen million, one hundred eleven thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •