Base | Representation |
---|---|
bin | 111100010110110… |
… | …110000000001100 |
3 | 2121120102111022111 |
4 | 330112312000030 |
5 | 4033212340244 |
6 | 244251553404 |
7 | 34044065521 |
oct | 7426660014 |
9 | 2546374274 |
10 | 1012621324 |
11 | 47a664430 |
12 | 24315b864 |
13 | 131a38c20 |
14 | 986b5148 |
15 | 5dd75e34 |
hex | 3c5b600c |
1012621324 has 48 divisors (see below), whose sum is σ = 2149088256. Its totient is φ = 411163200.
The previous prime is 1012621297. The next prime is 1012621327. The reversal of 1012621324 is 4231262101.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 1012621295 and 1012621304.
It is not an unprimeable number, because it can be changed into a prime (1012621327) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 10822 + ... + 46285.
It is an arithmetic number, because the mean of its divisors is an integer number (44772672).
Almost surely, 21012621324 is an apocalyptic number.
It is an amenable number.
1012621324 is an abundant number, since it is smaller than the sum of its proper divisors (1136466932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012621324 is a wasteful number, since it uses less digits than its factorization.
1012621324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57166 (or 57164 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 1012621324 is about 31821.7115190242. The cubic root of 1012621324 is about 1004.1895313156.
Adding to 1012621324 its reverse (4231262101), we get a palindrome (5243883425).
The spelling of 1012621324 in words is "one billion, twelve million, six hundred twenty-one thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •