Base | Representation |
---|---|
bin | 111110000111011… |
… | …000101010100111 |
3 | 2200121221100121010 |
4 | 332013120222213 |
5 | 4113240422211 |
6 | 251224153303 |
7 | 34552621506 |
oct | 7607305247 |
9 | 2617840533 |
10 | 1042123431 |
11 | 495284838 |
12 | 251008833 |
13 | 137b983ab |
14 | 9c59483d |
15 | 617524a6 |
hex | 3e1d8aa7 |
1042123431 has 16 divisors (see below), whose sum is σ = 1415790720. Its totient is φ = 681648480.
The previous prime is 1042123391. The next prime is 1042123483. The reversal of 1042123431 is 1343212401.
It is not a de Polignac number, because 1042123431 - 26 = 1042123367 is a prime.
It is a super-2 number, since 2×10421234312 = 2172042490878423522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1042123398 and 1042123407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042123531) 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 15 ways as a sum of consecutive naturals, for example, 90316 + ... + 101198.
It is an arithmetic number, because the mean of its divisors is an integer number (88486920).
Almost surely, 21042123431 is an apocalyptic number.
1042123431 is a deficient number, since it is larger than the sum of its proper divisors (373667289).
1042123431 is a wasteful number, since it uses less digits than its factorization.
1042123431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11486.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 1042123431 is about 32281.9366054764. The cubic root of 1042123431 is about 1013.8484780342.
Adding to 1042123431 its reverse (1343212401), we get a palindrome (2385335832).
The spelling of 1042123431 in words is "one billion, forty-two million, one hundred twenty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •