Base | Representation |
---|---|
bin | 11000100101100… |
… | …111000100110001 |
3 | 1001202012210212000 |
4 | 120211213010301 |
5 | 1321100400221 |
6 | 104533324213 |
7 | 13136204346 |
oct | 3045470461 |
9 | 1052183760 |
10 | 412512561 |
11 | 1a194187a |
12 | b6196669 |
13 | 67602996 |
14 | 3cb007cd |
15 | 26335e26 |
hex | 18967131 |
412512561 has 48 divisors (see below), whose sum is σ = 643173120. Its totient is φ = 261118080.
The previous prime is 412512539. The next prime is 412512679. The reversal of 412512561 is 165215214.
It is not a de Polignac number, because 412512561 - 211 = 412510513 is a prime.
It is a super-2 number, since 2×4125125612 = 340333225965557442, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (412512511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5650821 + ... + 5650893.
It is an arithmetic number, because the mean of its divisors is an integer number (13399440).
Almost surely, 2412512561 is an apocalyptic number.
It is an amenable number.
412512561 is a deficient number, since it is larger than the sum of its proper divisors (230660559).
412512561 is an equidigital number, since it uses as much as digits as its factorization.
412512561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263 (or 184 counting only the distinct ones).
The product of its digits is 2400, while the sum is 27.
The square root of 412512561 is about 20310.4052396795. The cubic root of 412512561 is about 744.4103323140.
Adding to 412512561 its reverse (165215214), we get a palindrome (577727775).
The spelling of 412512561 in words is "four hundred twelve million, five hundred twelve thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •