Base | Representation |
---|---|
bin | 111101011101111… |
… | …000011010100111 |
3 | 2122212110121001011 |
4 | 331131320122213 |
5 | 4102444242211 |
6 | 250155043051 |
7 | 34361265421 |
oct | 7535703247 |
9 | 2585417034 |
10 | 1031243431 |
11 | 48a1234a9 |
12 | 249440487 |
13 | 13585911a |
14 | 9ad61811 |
15 | 60803921 |
hex | 3d7786a7 |
1031243431 has 8 divisors (see below), whose sum is σ = 1057004784. Its totient is φ = 1005787200.
The previous prime is 1031243417. The next prime is 1031243483. The reversal of 1031243431 is 1343421301.
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 1031243431 - 211 = 1031241383 is a prime.
It is a super-2 number, since 2×10312434312 = 2126926027961303522, 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 (1031243131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69430 + ... + 82963.
It is an arithmetic number, because the mean of its divisors is an integer number (132125598).
Almost surely, 21031243431 is an apocalyptic number.
1031243431 is a deficient number, since it is larger than the sum of its proper divisors (25761353).
1031243431 is a wasteful number, since it uses less digits than its factorization.
1031243431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152561.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 1031243431 is about 32112.9791673087. The cubic root of 1031243431 is about 1010.3078599465.
Adding to 1031243431 its reverse (1343421301), we get a palindrome (2374664732).
The spelling of 1031243431 in words is "one billion, thirty-one million, two hundred forty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •