Base | Representation |
---|---|
bin | 10011010100110… |
… | …011111000001000 |
3 | 211121002012121201 |
4 | 103110303320020 |
5 | 1131000104342 |
6 | 52101113544 |
7 | 11014563010 |
oct | 2324637010 |
9 | 747065551 |
10 | 324222472 |
11 | 157019162 |
12 | 906b88b4 |
13 | 5222c122 |
14 | 310bac40 |
15 | 1d6e5db7 |
hex | 13533e08 |
324222472 has 32 divisors (see below), whose sum is σ = 697377600. Its totient is φ = 138429504.
The previous prime is 324222469. The next prime is 324222533. The reversal of 324222472 is 274222423.
It is a super-2 number, since 2×3242224722 = 210240422699581568, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 324222472.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4303 + ... + 25825.
It is an arithmetic number, because the mean of its divisors is an integer number (21793050).
Almost surely, 2324222472 is an apocalyptic number.
It is an amenable number.
324222472 is an abundant number, since it is smaller than the sum of its proper divisors (373155128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
324222472 is a wasteful number, since it uses less digits than its factorization.
324222472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21805 (or 21801 counting only the distinct ones).
The product of its digits is 10752, while the sum is 28.
The square root of 324222472 is about 18006.1787173181. The cubic root of 324222472 is about 686.9857113350.
Adding to 324222472 its reverse (274222423), we get a palindrome (598444895).
The spelling of 324222472 in words is "three hundred twenty-four million, two hundred twenty-two thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •