Base | Representation |
---|---|
bin | 1001011101000101111… |
… | …11000111110101001101 |
3 | 1011001111211202122000111 |
4 | 10232202333013311031 |
5 | 20310301343101331 |
6 | 405123125000021 |
7 | 32320154653003 |
oct | 4564277076515 |
9 | 1131454678014 |
10 | 324857003341 |
11 | 115853344872 |
12 | 52b61b53011 |
13 | 24831848b00 |
14 | 11a1a504a73 |
15 | 86b4a36db1 |
hex | 4ba2fc7d4d |
324857003341 has 12 divisors (see below), whose sum is σ = 352764809748. Its totient is φ = 299018463744.
The previous prime is 324857003329. The next prime is 324857003369. The reversal of 324857003341 is 143300758423.
It can be written as a sum of positive squares in 6 ways, for example, as 43776774441 + 281080228900 = 209229^2 + 530170^2 .
It is not a de Polignac number, because 324857003341 - 213 = 324856995149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 324857003294 and 324857003303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (324857043341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2663050 + ... + 2782363.
It is an arithmetic number, because the mean of its divisors is an integer number (29397067479).
Almost surely, 2324857003341 is an apocalyptic number.
It is an amenable number.
324857003341 is a deficient number, since it is larger than the sum of its proper divisors (27907806407).
324857003341 is a wasteful number, since it uses less digits than its factorization.
324857003341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5445792 (or 5445779 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 40.
The spelling of 324857003341 in words is "three hundred twenty-four billion, eight hundred fifty-seven million, three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •