Base | Representation |
---|---|
bin | 11000101011110… |
… | …001111101101001 |
3 | 1001212020222121002 |
4 | 120223301331221 |
5 | 1322004130100 |
6 | 105032124345 |
7 | 13156022111 |
oct | 3053617551 |
9 | 1055228532 |
10 | 414130025 |
11 | 1a2847021 |
12 | b68366b5 |
13 | 67a4ac6a |
14 | 3d002041 |
15 | 265552d5 |
hex | 18af1f69 |
414130025 has 12 divisors (see below), whose sum is σ = 516676752. Its totient is φ = 329268240.
The previous prime is 414130001. The next prime is 414130091. The reversal of 414130025 is 520031414.
414130025 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 414130025 - 28 = 414129769 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 414129979 and 414130006.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 46739 + ... + 54888.
It is an arithmetic number, because the mean of its divisors is an integer number (43056396).
Almost surely, 2414130025 is an apocalyptic number.
It is an amenable number.
414130025 is a deficient number, since it is larger than the sum of its proper divisors (102546727).
414130025 is a wasteful number, since it uses less digits than its factorization.
414130025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101800 (or 101795 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 414130025 is about 20350.1848885950. The cubic root of 414130025 is about 745.3820090918.
Adding to 414130025 its reverse (520031414), we get a palindrome (934161439).
The spelling of 414130025 in words is "four hundred fourteen million, one hundred thirty thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •