Base | Representation |
---|---|
bin | 100100111101001… |
… | …1000001111100111 |
3 | 10012102100120200002 |
4 | 1021322120033213 |
5 | 10014422243143 |
6 | 323014211515 |
7 | 42505112126 |
oct | 11172301747 |
9 | 3172316602 |
10 | 1240040423 |
11 | 586a747a6 |
12 | 2a7353b9b |
13 | 169ba353b |
14 | ba993abd |
15 | 73ce95b8 |
hex | 49e983e7 |
1240040423 has 8 divisors (see below), whose sum is σ = 1295403648. Its totient is φ = 1184797944.
The previous prime is 1240040411. The next prime is 1240040429. The reversal of 1240040423 is 3240400421.
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 1240040423 - 214 = 1240024039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1240040395 and 1240040404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1240040429) 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, 8861 + ... + 50582.
It is an arithmetic number, because the mean of its divisors is an integer number (161925456).
Almost surely, 21240040423 is an apocalyptic number.
1240040423 is a deficient number, since it is larger than the sum of its proper divisors (55363225).
1240040423 is an equidigital number, since it uses as much as digits as its factorization.
1240040423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60373.
The product of its (nonzero) digits is 768, while the sum is 20.
The square root of 1240040423 is about 35214.2076866710. The cubic root of 1240040423 is about 1074.3487450362.
Adding to 1240040423 its reverse (3240400421), we get a palindrome (4480440844).
The spelling of 1240040423 in words is "one billion, two hundred forty million, forty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •