Base | Representation |
---|---|
bin | 100100111111111100110001… |
… | …0010011101101010000111101 |
3 | 1120200022120110121200212110122 |
4 | 1021333321202103231100331 |
5 | 320124122012303023123 |
6 | 3112100551044344325 |
7 | 125356610151655124 |
oct | 11177714223552075 |
9 | 1520276417625418 |
10 | 325448501220413 |
11 | 94774a3057214a |
12 | 306021246a50a5 |
13 | 10c7987b4a521c |
14 | 5a51b11c66abb |
15 | 27959e07ebbc8 |
hex | 127fe624ed43d |
325448501220413 has 8 divisors (see below), whose sum is σ = 333249910884480. Its totient is φ = 317683632117600.
The previous prime is 325448501220371. The next prime is 325448501220431. The reversal of 325448501220413 is 314022105844523.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 325448501220413 - 224 = 325448484443197 is a prime.
It is a super-2 number, since 2×3254485012204132 (a number of 30 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (325448501220313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9135122288 + ... + 9135157913.
It is an arithmetic number, because the mean of its divisors is an integer number (41656238860560).
Almost surely, 2325448501220413 is an apocalyptic number.
It is an amenable number.
325448501220413 is a deficient number, since it is larger than the sum of its proper divisors (7801409664067).
325448501220413 is a wasteful number, since it uses less digits than its factorization.
325448501220413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18270280627.
The product of its (nonzero) digits is 921600, while the sum is 44.
The spelling of 325448501220413 in words is "three hundred twenty-five trillion, four hundred forty-eight billion, five hundred one million, two hundred twenty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •