Base | Representation |
---|---|
bin | 1000001101001111… |
… | …11101001101000001 |
3 | 102101001212022122021 |
4 | 10012213331031001 |
5 | 33010430324042 |
6 | 2005114041441 |
7 | 214121162605 |
oct | 40647751501 |
9 | 12331768567 |
10 | 4406104897 |
11 | 1961149907 |
12 | a2b719281 |
13 | 552abc97c |
14 | 2db267505 |
15 | 1abc42867 |
hex | 1069fd341 |
4406104897 has 8 divisors (see below), whose sum is σ = 4677046056. Its totient is φ = 4136470272.
The previous prime is 4406104891. The next prime is 4406104903. The reversal of 4406104897 is 7984016044.
It is an interprime number because it is at equal distance from previous prime (4406104891) and next prime (4406104903).
It can be written as a sum of positive squares in 4 ways, for example, as 983386881 + 3422718016 = 31359^2 + 58504^2 .
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-4406104897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4406104891) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 319678 + ... + 333175.
It is an arithmetic number, because the mean of its divisors is an integer number (584630757).
Almost surely, 24406104897 is an apocalyptic number.
It is an amenable number.
4406104897 is a deficient number, since it is larger than the sum of its proper divisors (270941159).
4406104897 is a wasteful number, since it uses less digits than its factorization.
4406104897 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 653267.
The product of its (nonzero) digits is 193536, while the sum is 43.
The square root of 4406104897 is about 66378.4972487326. The cubic root of 4406104897 is about 1639.4000503561.
The spelling of 4406104897 in words is "four billion, four hundred six million, one hundred four thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •