Base | Representation |
---|---|
bin | 100100110111101011000111… |
… | …1111110101000010001010000 |
3 | 1120112021211122020201210222011 |
4 | 1021233112033332220101100 |
5 | 320002003113341112144 |
6 | 3105430244004552304 |
7 | 125211463262403565 |
oct | 11157261776502120 |
9 | 1515254566653864 |
10 | 324311101113424 |
11 | 94376624895227 |
12 | 304597b76b2694 |
13 | 10bc6537180a39 |
14 | 5a12a5360686c |
15 | 2776121722a34 |
hex | 126f58ffa8450 |
324311101113424 has 10 divisors (see below), whose sum is σ = 628352758407290. Its totient is φ = 162155550556704.
The previous prime is 324311101113413. The next prime is 324311101113437. The reversal of 324311101113424 is 424311101113423.
It can be written as a sum of positive squares in only one way, i.e., 162448585963024 + 161862515150400 = 12745532^2 + 12722520^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10134721909779 + ... + 10134721909810.
It is an arithmetic number, because the mean of its divisors is an integer number (62835275840729).
Almost surely, 2324311101113424 is an apocalyptic number.
It is an amenable number.
324311101113424 is a deficient number, since it is larger than the sum of its proper divisors (304041657293866).
324311101113424 is a wasteful number, since it uses less digits than its factorization.
324311101113424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20269443819597 (or 20269443819591 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 31.
Adding to 324311101113424 its reverse (424311101113423), we get a palindrome (748622202226847).
Subtracting 324311101113424 from its reverse (424311101113423), we obtain a palindrome (99999999999999).
The spelling of 324311101113424 in words is "three hundred twenty-four trillion, three hundred eleven billion, one hundred one million, one hundred thirteen thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •