Base | Representation |
---|---|
bin | 1111000011010110… |
… | …1110000010000111 |
3 | 101102121010110102020 |
4 | 3300311232002013 |
5 | 31233344122043 |
6 | 1504540214223 |
7 | 202062436545 |
oct | 36065560207 |
9 | 11377113366 |
10 | 4040614023 |
11 | 1793904136 |
12 | 94923a373 |
13 | 4c5171894 |
14 | 2a48c6d95 |
15 | 189ae8e83 |
hex | f0d6e087 |
4040614023 has 4 divisors (see below), whose sum is σ = 5387485368. Its totient is φ = 2693742680.
The previous prime is 4040613961. The next prime is 4040614037. The reversal of 4040614023 is 3204160404.
4040614023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 4040614023 - 26 = 4040613959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4040613984 and 4040614002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4040614073) 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, 673435668 + ... + 673435673.
It is an arithmetic number, because the mean of its divisors is an integer number (1346871342).
Almost surely, 24040614023 is an apocalyptic number.
4040614023 is a deficient number, since it is larger than the sum of its proper divisors (1346871345).
4040614023 is a wasteful number, since it uses less digits than its factorization.
4040614023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1346871344.
The product of its (nonzero) digits is 2304, while the sum is 24.
The square root of 4040614023 is about 63565.8243319474. The cubic root of 4040614023 is about 1592.7555323057.
Adding to 4040614023 its reverse (3204160404), we get a palindrome (7244774427).
The spelling of 4040614023 in words is "four billion, forty million, six hundred fourteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •