Base | Representation |
---|---|
bin | 1000001101000111… |
… | …10101111101010001 |
3 | 102100222211112112212 |
4 | 10012203311331101 |
5 | 33010141323031 |
6 | 2005035001505 |
7 | 214106052161 |
oct | 40643657521 |
9 | 12328745485 |
10 | 4405026641 |
11 | 1960582794 |
12 | a2b299295 |
13 | 552802c52 |
14 | 2db0665a1 |
15 | 1abacd12b |
hex | 1068f5f51 |
4405026641 has 4 divisors (see below), whose sum is σ = 4405446384. Its totient is φ = 4404606900.
The previous prime is 4405026629. The next prime is 4405026643. The reversal of 4405026641 is 1466205044.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4405026641 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4405026598 and 4405026607.
It is not an unprimeable number, because it can be changed into a prime (4405026643) 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, 193715 + ... + 215256.
It is an arithmetic number, because the mean of its divisors is an integer number (1101361596).
Almost surely, 24405026641 is an apocalyptic number.
It is an amenable number.
4405026641 is a deficient number, since it is larger than the sum of its proper divisors (419743).
4405026641 is a wasteful number, since it uses less digits than its factorization.
4405026641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419742.
The product of its (nonzero) digits is 23040, while the sum is 32.
The square root of 4405026641 is about 66370.3747239685. The cubic root of 4405026641 is about 1639.2663088620.
The spelling of 4405026641 in words is "four billion, four hundred five million, twenty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •