Base | Representation |
---|---|
bin | 111110000111001… |
… | …010101011001011 |
3 | 2200121211102222121 |
4 | 332013022223023 |
5 | 4113232103443 |
6 | 251223032111 |
7 | 34552262440 |
oct | 7607125313 |
9 | 2617742877 |
10 | 1042066123 |
11 | 49524577a |
12 | 250b9b637 |
13 | 137b78297 |
14 | 9c57b9c7 |
15 | 617404ed |
hex | 3e1caacb |
1042066123 has 4 divisors (see below), whose sum is σ = 1190932720. Its totient is φ = 893199528.
The previous prime is 1042066049. The next prime is 1042066189. The reversal of 1042066123 is 3216602401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1042066123 - 213 = 1042057931 is a prime.
It is a super-2 number, since 2×10420661232 = 2171803609408502258, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1042067123) 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 3 ways as a sum of consecutive naturals, for example, 74433288 + ... + 74433301.
It is an arithmetic number, because the mean of its divisors is an integer number (297733180).
Almost surely, 21042066123 is an apocalyptic number.
1042066123 is a deficient number, since it is larger than the sum of its proper divisors (148866597).
1042066123 is an equidigital number, since it uses as much as digits as its factorization.
1042066123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148866596.
The product of its (nonzero) digits is 1728, while the sum is 25.
The square root of 1042066123 is about 32281.0489761408. The cubic root of 1042066123 is about 1013.8298933215.
Adding to 1042066123 its reverse (3216602401), we get a palindrome (4258668524).
The spelling of 1042066123 in words is "one billion, forty-two million, sixty-six thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •