Base | Representation |
---|---|
bin | 100111011101111… |
… | …1010110111000100 |
3 | 10102021221221211102 |
4 | 1032323322313010 |
5 | 10203012033221 |
6 | 335224555232 |
7 | 44550423452 |
oct | 11673726704 |
9 | 3367857742 |
10 | 1324330436 |
11 | 61a606070 |
12 | 30b622b18 |
13 | 1814a64a0 |
14 | c7c559d2 |
15 | 7b3e930b |
hex | 4eefadc4 |
1324330436 has 24 divisors (see below), whose sum is σ = 2722750464. Its totient is φ = 555662880.
The previous prime is 1324330429. The next prime is 1324330471. The reversal of 1324330436 is 6340334231.
It is a happy number.
It is a super-2 number, since 2×13243304362 = 3507702207431900192, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1324330399 and 1324330408.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1157060 + ... + 1158203.
It is an arithmetic number, because the mean of its divisors is an integer number (113447936).
Almost surely, 21324330436 is an apocalyptic number.
It is an amenable number.
1324330436 is an abundant number, since it is smaller than the sum of its proper divisors (1398420028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1324330436 is a wasteful number, since it uses less digits than its factorization.
1324330436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2315291 (or 2315289 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 29.
The square root of 1324330436 is about 36391.3511153406. The cubic root of 1324330436 is about 1098.1595770294.
Adding to 1324330436 its reverse (6340334231), we get a palindrome (7664664667).
The spelling of 1324330436 in words is "one billion, three hundred twenty-four million, three hundred thirty thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •