Base | Representation |
---|---|
bin | 111110001000111… |
… | …110011011000111 |
3 | 2200122201112100011 |
4 | 332020332123013 |
5 | 4113342241411 |
6 | 251241131051 |
7 | 34556305615 |
oct | 7610763307 |
9 | 2618645304 |
10 | 1042540231 |
11 | 4955399a7 |
12 | 251189a87 |
13 | 137cb3015 |
14 | 9c6626b5 |
15 | 617d5c21 |
hex | 3e23e6c7 |
1042540231 has 4 divisors (see below), whose sum is σ = 1070717032. Its totient is φ = 1014363432.
The previous prime is 1042540223. The next prime is 1042540237. The reversal of 1042540231 is 1320452401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1320452401 = 127 ⋅10397263.
It is a cyclic number.
It is not a de Polignac number, because 1042540231 - 23 = 1042540223 is a prime.
It is a super-2 number, since 2×10425402312 = 2173780266507066722, 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 (1042540237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14088345 + ... + 14088418.
It is an arithmetic number, because the mean of its divisors is an integer number (267679258).
Almost surely, 21042540231 is an apocalyptic number.
1042540231 is a deficient number, since it is larger than the sum of its proper divisors (28176801).
1042540231 is an equidigital number, since it uses as much as digits as its factorization.
1042540231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28176800.
The product of its (nonzero) digits is 960, while the sum is 22.
The square root of 1042540231 is about 32288.3915827345. The cubic root of 1042540231 is about 1013.9836238046.
Adding to 1042540231 its reverse (1320452401), we get a palindrome (2362992632).
The spelling of 1042540231 in words is "one billion, forty-two million, five hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •