Base | Representation |
---|---|
bin | 11000100000001… |
… | …111001111010101 |
3 | 1001122120020221222 |
4 | 120200033033111 |
5 | 1320220313323 |
6 | 104443220125 |
7 | 13121220362 |
oct | 3040171725 |
9 | 1048506858 |
10 | 411104213 |
11 | 1a106a753 |
12 | b5817645 |
13 | 6722b940 |
14 | 3c855469 |
15 | 261589c8 |
hex | 1880f3d5 |
411104213 has 8 divisors (see below), whose sum is σ = 442930488. Its totient is φ = 379306944.
The previous prime is 411104191. The next prime is 411104249. The reversal of 411104213 is 312401114.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 13380964 + 397723249 = 3658^2 + 19943^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-411104213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 411104191 and 411104200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (411104263) 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, 28895 + ... + 40707.
It is an arithmetic number, because the mean of its divisors is an integer number (55366311).
Almost surely, 2411104213 is an apocalyptic number.
It is an amenable number.
411104213 is a deficient number, since it is larger than the sum of its proper divisors (31826275).
411104213 is a wasteful number, since it uses less digits than its factorization.
411104213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14503.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 411104213 is about 20275.7049939083. The cubic root of 411104213 is about 743.5622093217.
Adding to 411104213 its reverse (312401114), we get a palindrome (723505327).
The spelling of 411104213 in words is "four hundred eleven million, one hundred four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •