Base | Representation |
---|---|
bin | 100100111110111111001101… |
… | …0100111101110100011110001 |
3 | 1120122211221020102112222112011 |
4 | 1021331332122213232203301 |
5 | 320114440241303202023 |
6 | 3111520125044402521 |
7 | 125344220142124336 |
oct | 11175763247564361 |
9 | 1518757212488464 |
10 | 325316302006513 |
11 | 94723961560074 |
12 | 305a058b3a6441 |
13 | 10c6a270ab5abc |
14 | 5a4957068698d |
15 | 279235487450d |
hex | 127df9a9ee8f1 |
325316302006513 has 4 divisors (see below), whose sum is σ = 328537255491828. Its totient is φ = 322095348521200.
The previous prime is 325316302006439. The next prime is 325316302006571. The reversal of 325316302006513 is 315600203613523.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 254668360222224 + 70647941784289 = 15958332^2 + 8405233^2 .
It is a cyclic number.
It is not a de Polignac number, because 325316302006513 - 29 = 325316302006001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (325316302001513) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1610476742506 + ... + 1610476742707.
It is an arithmetic number, because the mean of its divisors is an integer number (82134313872957).
Almost surely, 2325316302006513 is an apocalyptic number.
It is an amenable number.
325316302006513 is a deficient number, since it is larger than the sum of its proper divisors (3220953485315).
325316302006513 is a wasteful number, since it uses less digits than its factorization.
325316302006513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3220953485314.
The product of its (nonzero) digits is 291600, while the sum is 40.
The spelling of 325316302006513 in words is "three hundred twenty-five trillion, three hundred sixteen billion, three hundred two million, six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •