Base | Representation |
---|---|
bin | 1000011111101101… |
… | …11011100001101011 |
3 | 102202212101002020201 |
4 | 10033312323201223 |
5 | 33320110301011 |
6 | 2032330333031 |
7 | 221012034235 |
oct | 41766734153 |
9 | 12685332221 |
10 | 4561025131 |
11 | 1a30641763 |
12 | a7358a177 |
13 | 578c22250 |
14 | 313a73255 |
15 | 1ba644cc1 |
hex | 10fdbb86b |
4561025131 has 8 divisors (see below), whose sum is σ = 4917616704. Its totient is φ = 4205254080.
The previous prime is 4561025059. The next prime is 4561025167. The reversal of 4561025131 is 1315201654.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4561025131 - 213 = 4561016939 is a prime.
It is a super-2 number, since 2×45610251312 = 41605900491227134322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4561025131.
It is not an unprimeable number, because it can be changed into a prime (4561025191) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 193555 + ... + 215836.
It is an arithmetic number, because the mean of its divisors is an integer number (614702088).
Almost surely, 24561025131 is an apocalyptic number.
4561025131 is a deficient number, since it is larger than the sum of its proper divisors (356591573).
4561025131 is a wasteful number, since it uses less digits than its factorization.
4561025131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 410261.
The product of its (nonzero) digits is 3600, while the sum is 28.
The square root of 4561025131 is about 67535.3620779514. The cubic root of 4561025131 is about 1658.3931238854.
Adding to 4561025131 its reverse (1315201654), we get a palindrome (5876226785).
The spelling of 4561025131 in words is "four billion, five hundred sixty-one million, twenty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •