Base | Representation |
---|---|
bin | 111101000100010… |
… | …001101111011110 |
3 | 2122101211120220020 |
4 | 331010101233132 |
5 | 4044240001142 |
6 | 245355133010 |
7 | 34250242035 |
oct | 7504215736 |
9 | 2571746806 |
10 | 1024531422 |
11 | 486359692 |
12 | 247144166 |
13 | 134349015 |
14 | 9a0d571c |
15 | 5ee29cec |
hex | 3d111bde |
1024531422 has 8 divisors (see below), whose sum is σ = 2049062856. Its totient is φ = 341510472.
The previous prime is 1024531379. The next prime is 1024531441. The reversal of 1024531422 is 2241354201.
It is a sphenic number, since it is the product of 3 distinct primes.
1024531422 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1024531392 and 1024531401.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 85377613 + ... + 85377624.
It is an arithmetic number, because the mean of its divisors is an integer number (256132857).
Almost surely, 21024531422 is an apocalyptic number.
1024531422 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1024531422 is a wasteful number, since it uses less digits than its factorization.
1024531422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170755242.
The product of its (nonzero) digits is 1920, while the sum is 24.
The square root of 1024531422 is about 32008.3023917233. The cubic root of 1024531422 is about 1008.1111716797. Note that the first 4 decimals are identical.
Adding to 1024531422 its reverse (2241354201), we get a palindrome (3265885623).
The spelling of 1024531422 in words is "one billion, twenty-four million, five hundred thirty-one thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •