Base | Representation |
---|---|
bin | 11000101101010… |
… | …100101111110001 |
3 | 1001220000112121212 |
4 | 120231110233301 |
5 | 1322110102031 |
6 | 105044525505 |
7 | 13162325543 |
oct | 3055245761 |
9 | 1056015555 |
10 | 414534641 |
11 | 1a2aa3014 |
12 | b69b0895 |
13 | 67b60191 |
14 | 3d0a9693 |
15 | 265d512b |
hex | 18b54bf1 |
414534641 has 8 divisors (see below), whose sum is σ = 429027144. Its totient is φ = 400250880.
The previous prime is 414534623. The next prime is 414534683. The reversal of 414534641 is 146435414.
It can be written as a sum of positive squares in 4 ways, for example, as 19360000 + 395174641 = 4400^2 + 19879^2 .
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 414534641 - 218 = 414272497 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 414534598 and 414534607.
It is not an unprimeable number, because it can be changed into a prime (414534691) 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, 48140 + ... + 56093.
It is an arithmetic number, because the mean of its divisors is an integer number (53628393).
Almost surely, 2414534641 is an apocalyptic number.
414534641 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
414534641 is a deficient number, since it is larger than the sum of its proper divisors (14492503).
414534641 is a wasteful number, since it uses less digits than its factorization.
414534641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104371.
The product of its digits is 23040, while the sum is 32.
The square root of 414534641 is about 20360.1237962838. The cubic root of 414534641 is about 745.6246827293.
The spelling of 414534641 in words is "four hundred fourteen million, five hundred thirty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •