Base | Representation |
---|---|
bin | 11000101000000… |
… | …001010110001101 |
3 | 1001210101220122201 |
4 | 120220001112031 |
5 | 1321231110321 |
6 | 104555041501 |
7 | 13144445542 |
oct | 3050012615 |
9 | 1053356581 |
10 | 413144461 |
11 | 1a2233604 |
12 | b6440291 |
13 | 677944a2 |
14 | 3cc26bc9 |
15 | 2640d291 |
hex | 18a0158d |
413144461 has 8 divisors (see below), whose sum is σ = 416691000. Its totient is φ = 409605888.
The previous prime is 413144447. The next prime is 413144477. The reversal of 413144461 is 164441314.
It can be written as a sum of positive squares in 4 ways, for example, as 4862025 + 408282436 = 2205^2 + 20206^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 413144461 - 29 = 413143949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413144261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 148915 + ... + 151663.
It is an arithmetic number, because the mean of its divisors is an integer number (52086375).
Almost surely, 2413144461 is an apocalyptic number.
It is an amenable number.
413144461 is a deficient number, since it is larger than the sum of its proper divisors (3546539).
413144461 is a wasteful number, since it uses less digits than its factorization.
413144461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3983.
The product of its digits is 4608, while the sum is 28.
The square root of 413144461 is about 20325.9553527011. The cubic root of 413144461 is about 744.7902422852.
Adding to 413144461 its reverse (164441314), we get a palindrome (577585775).
The spelling of 413144461 in words is "four hundred thirteen million, one hundred forty-four thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •