Base | Representation |
---|---|
bin | 111110000110111… |
… | …101100100000111 |
3 | 2200121201201022201 |
4 | 332012331210013 |
5 | 4113223344143 |
6 | 251221535331 |
7 | 34551650044 |
oct | 7606754407 |
9 | 2617651281 |
10 | 1042012423 |
11 | 4952093a1 |
12 | 250b74547 |
13 | 137b599ca |
14 | 9c5661cb |
15 | 6172e64d |
hex | 3e1bd907 |
1042012423 has 8 divisors (see below), whose sum is σ = 1055962160. Its totient is φ = 1028142720.
The previous prime is 1042012403. The next prime is 1042012453. The reversal of 1042012423 is 3242102401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1042012423 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1042012423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042012403) 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 7 ways as a sum of consecutive naturals, for example, 6436 + ... + 46102.
It is an arithmetic number, because the mean of its divisors is an integer number (131995270).
Almost surely, 21042012423 is an apocalyptic number.
1042012423 is a deficient number, since it is larger than the sum of its proper divisors (13949737).
1042012423 is a wasteful number, since it uses less digits than its factorization.
1042012423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40017.
The product of its (nonzero) digits is 384, while the sum is 19.
The square root of 1042012423 is about 32280.2172080672. The cubic root of 1042012423 is about 1013.8124780477.
Adding to 1042012423 its reverse (3242102401), we get a palindrome (4284114824).
The spelling of 1042012423 in words is "one billion, forty-two million, twelve thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.271 sec. • engine limits •