Base | Representation |
---|---|
bin | 1001011101001100101… |
… | …11010100111001011001 |
3 | 1011001122210102002201120 |
4 | 10232212113110321121 |
5 | 20310410400224321 |
6 | 405132511435453 |
7 | 32321443465653 |
oct | 4564627247131 |
9 | 1131583362646 |
10 | 324913679961 |
11 | 115882335852 |
12 | 52b78b25b89 |
13 | 24840501180 |
14 | 11a23c596d3 |
15 | 86b99ceec6 |
hex | 4ba65d4e59 |
324913679961 has 16 divisors (see below), whose sum is σ = 469239508416. Its totient is φ = 198791113536.
The previous prime is 324913679947. The next prime is 324913679963. The reversal of 324913679961 is 169976319423.
It is a happy number.
It is not a de Polignac number, because 324913679961 - 210 = 324913678937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 324913679895 and 324913679904.
It is not an unprimeable number, because it can be changed into a prime (324913679963) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24071635 + ... + 24085128.
It is an arithmetic number, because the mean of its divisors is an integer number (29327469276).
Almost surely, 2324913679961 is an apocalyptic number.
It is an amenable number.
324913679961 is a deficient number, since it is larger than the sum of its proper divisors (144325828455).
324913679961 is a wasteful number, since it uses less digits than its factorization.
324913679961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48156952.
The product of its digits is 13226976, while the sum is 60.
The spelling of 324913679961 in words is "three hundred twenty-four billion, nine hundred thirteen million, six hundred seventy-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •