Base | Representation |
---|---|
bin | 1011010100110100… |
… | …1110101010101001 |
3 | 21211212120022121110 |
4 | 2311031032222221 |
5 | 22211234102131 |
6 | 1221400500533 |
7 | 135223540464 |
oct | 26515165251 |
9 | 7755508543 |
10 | 3040144041 |
11 | 132009a240 |
12 | 70a17a749 |
13 | 395acb7cc |
14 | 20ba962db |
15 | 12bd73646 |
hex | b534eaa9 |
3040144041 has 8 divisors (see below), whose sum is σ = 4422027744. Its totient is φ = 1842511520.
The previous prime is 3040144031. The next prime is 3040144043. The reversal of 3040144041 is 1404410403.
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 3040144041 - 221 = 3038046889 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3040143999 and 3040144017.
It is not an unprimeable number, because it can be changed into a prime (3040144043) 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, 46062756 + ... + 46062821.
It is an arithmetic number, because the mean of its divisors is an integer number (552753468).
Almost surely, 23040144041 is an apocalyptic number.
It is an amenable number.
3040144041 is a deficient number, since it is larger than the sum of its proper divisors (1381883703).
3040144041 is a wasteful number, since it uses less digits than its factorization.
3040144041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92125591.
The product of its (nonzero) digits is 768, while the sum is 21.
The square root of 3040144041 is about 55137.5012219451. The cubic root of 3040144041 is about 1448.6541679651.
Adding to 3040144041 its reverse (1404410403), we get a palindrome (4444554444).
The spelling of 3040144041 in words is "three billion, forty million, one hundred forty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •