Base | Representation |
---|---|
bin | 111110000111110… |
… | …101011000000111 |
3 | 2200122011022220200 |
4 | 332013311120013 |
5 | 4113303203111 |
6 | 251230501543 |
7 | 34553621406 |
oct | 7607653007 |
9 | 2618138820 |
10 | 1042241031 |
11 | 495355127 |
12 | 2510648b3 |
13 | 137c09a90 |
14 | 9c5c563d |
15 | 61777256 |
hex | 3e1f5607 |
1042241031 has 24 divisors (see below), whose sum is σ = 1627167360. Its totient is φ = 639043776.
The previous prime is 1042241023. The next prime is 1042241047. The reversal of 1042241031 is 1301422401.
It is not a de Polignac number, because 1042241031 - 23 = 1042241023 is a prime.
It is a super-2 number, since 2×10422410312 = 2172532733399885922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1042240995 and 1042241013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042241231) 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 23 ways as a sum of consecutive naturals, for example, 16330 + ... + 48488.
It is an arithmetic number, because the mean of its divisors is an integer number (67798640).
Almost surely, 21042241031 is an apocalyptic number.
1042241031 is a deficient number, since it is larger than the sum of its proper divisors (584926329).
1042241031 is a wasteful number, since it uses less digits than its factorization.
1042241031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32455 (or 32452 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 1042241031 is about 32283.7580061554. The cubic root of 1042241031 is about 1013.8866130231.
Adding to 1042241031 its reverse (1301422401), we get a palindrome (2343663432).
The spelling of 1042241031 in words is "one billion, forty-two million, two hundred forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •