Base | Representation |
---|---|
bin | 1000100101101100… |
… | …10101100110010001 |
3 | 102220100210022011222 |
4 | 10102312111212101 |
5 | 33420431421200 |
6 | 2041322014425 |
7 | 222161364635 |
oct | 42266254621 |
9 | 12810708158 |
10 | 4611201425 |
11 | 1a569a2976 |
12 | a88347415 |
13 | 58643c96c |
14 | 31a5b4dc5 |
15 | 1bec56d85 |
hex | 112d95991 |
4611201425 has 6 divisors (see below), whose sum is σ = 5717889798. Its totient is φ = 3688961120.
The previous prime is 4611201421. The next prime is 4611201451. The reversal of 4611201425 is 5241021164.
It can be written as a sum of positive squares in 3 ways, for example, as 925133056 + 3686068369 = 30416^2 + 60713^2 .
It is not a de Polignac number, because 4611201425 - 22 = 4611201421 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4611201394 and 4611201403.
It is not an unprimeable number, because it can be changed into a prime (4611201421) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 92224004 + ... + 92224053.
It is an arithmetic number, because the mean of its divisors is an integer number (952981633).
Almost surely, 24611201425 is an apocalyptic number.
It is an amenable number.
4611201425 is a deficient number, since it is larger than the sum of its proper divisors (1106688373).
4611201425 is a wasteful number, since it uses less digits than its factorization.
4611201425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184448067 (or 184448062 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 26.
The square root of 4611201425 is about 67905.8276217881. The cubic root of 4611201425 is about 1664.4523414724.
Adding to 4611201425 its reverse (5241021164), we get a palindrome (9852222589).
The spelling of 4611201425 in words is "four billion, six hundred eleven million, two hundred one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •