Base | Representation |
---|---|
bin | 111101000011001… |
… | …011000101101111 |
3 | 2122101021212221001 |
4 | 331003023011233 |
5 | 4044201221111 |
6 | 245345021131 |
7 | 34244625241 |
oct | 7503130557 |
9 | 2571255831 |
10 | 1024242031 |
11 | 48618121a |
12 | 2470247a7 |
13 | 134277397 |
14 | 9a05c091 |
15 | 5edbe1c1 |
hex | 3d0cb16f |
1024242031 has 8 divisors (see below), whose sum is σ = 1038452480. Its totient is φ = 1010062872.
The previous prime is 1024242019. The next prime is 1024242067. The reversal of 1024242031 is 1302424201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1024242031 - 213 = 1024233839 is a prime.
It is a super-2 number, since 2×10242420312 = 2098143476134009922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1024242091) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 62416 + ... + 77098.
It is an arithmetic number, because the mean of its divisors is an integer number (129806560).
Almost surely, 21024242031 is an apocalyptic number.
1024242031 is a deficient number, since it is larger than the sum of its proper divisors (14210449).
1024242031 is an equidigital number, since it uses as much as digits as its factorization.
1024242031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15645.
The product of its (nonzero) digits is 384, while the sum is 19.
The square root of 1024242031 is about 32003.7815109402. The cubic root of 1024242031 is about 1008.0162451059.
Adding to 1024242031 its reverse (1302424201), we get a palindrome (2326666232).
The spelling of 1024242031 in words is "one billion, twenty-four million, two hundred forty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •