Base | Representation |
---|---|
bin | 1001011101001010001… |
… | …00101100110101010001 |
3 | 1011001121021122122220121 |
4 | 10232211010230311101 |
5 | 20310334324120144 |
6 | 405130415310241 |
7 | 32321061414352 |
oct | 4564504546521 |
9 | 1131537578817 |
10 | 324892020049 |
11 | 1158710913a3 |
12 | 52b7181b381 |
13 | 24838b8935c |
14 | 11a2101bd29 |
15 | 86b7b52384 |
hex | 4ba512cd51 |
324892020049 has 9 divisors (see below), whose sum is σ = 345137802897. Its totient is φ = 305771604864.
The previous prime is 324892020031. The next prime is 324892020053. The reversal of 324892020049 is 940020298423.
The square root of 324892020049 is 569993.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 52374611025 + 272517409024 = 228855^2 + 522032^2 .
It is not a de Polignac number, because 324892020049 - 25 = 324892020017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 324892019987 and 324892020014.
It is not an unprimeable number, because it can be changed into a prime (324892060049) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 9673117 + ... + 9706645.
Almost surely, 2324892020049 is an apocalyptic number.
324892020049 is the 569993-rd square number.
324892020049 is the 284997-th centered octagonal number.
It is an amenable number.
324892020049 is a deficient number, since it is larger than the sum of its proper divisors (20245782848).
324892020049 is an frugal number, since it uses more digits than its factorization.
324892020049 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67092 (or 33546 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 43.
The spelling of 324892020049 in words is "three hundred twenty-four billion, eight hundred ninety-two million, twenty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •