Base | Representation |
---|---|
bin | 11000101100001… |
… | …000011100101101 |
3 | 1001212102122221012 |
4 | 120230020130231 |
5 | 1322020102000 |
6 | 105034115005 |
7 | 13156554452 |
oct | 3054103455 |
9 | 1055378835 |
10 | 414222125 |
11 | 1a28aa239 |
12 | b687ba65 |
13 | 67a80b65 |
14 | 3d027829 |
15 | 26572735 |
hex | 18b0872d |
414222125 has 8 divisors (see below), whose sum is σ = 516949368. Its totient is φ = 331377600.
The previous prime is 414222101. The next prime is 414222163. The reversal of 414222125 is 521222414.
It can be written as a sum of positive squares in 4 ways, for example, as 121572676 + 292649449 = 11026^2 + 17107^2 .
It is not a de Polignac number, because 414222125 - 212 = 414218029 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 414222125.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1656764 + ... + 1657013.
It is an arithmetic number, because the mean of its divisors is an integer number (64618671).
Almost surely, 2414222125 is an apocalyptic number.
It is an amenable number.
414222125 is a deficient number, since it is larger than the sum of its proper divisors (102727243).
414222125 is an equidigital number, since it uses as much as digits as its factorization.
414222125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3313792 (or 3313782 counting only the distinct ones).
The product of its digits is 1280, while the sum is 23.
The square root of 414222125 is about 20352.4476415000. The cubic root of 414222125 is about 745.4372611386.
Adding to 414222125 its reverse (521222414), we get a palindrome (935444539).
The spelling of 414222125 in words is "four hundred fourteen million, two hundred twenty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •