Base | Representation |
---|---|
bin | 11111010101001… |
… | …010100110011101 |
3 | 1100122002101110110 |
4 | 133111022212131 |
5 | 2034031022031 |
6 | 124054200233 |
7 | 16011612243 |
oct | 3725124635 |
9 | 1318071413 |
10 | 525642141 |
11 | 24a7907a2 |
12 | 128053079 |
13 | 84b9266b |
14 | 4db4c793 |
15 | 31230c46 |
hex | 1f54a99d |
525642141 has 8 divisors (see below), whose sum is σ = 701409280. Its totient is φ = 350151552.
The previous prime is 525642137. The next prime is 525642149. The reversal of 525642141 is 141246525.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 525642141 - 22 = 525642137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 525642099 and 525642108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (525642149) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 64660 + ... + 72333.
It is an arithmetic number, because the mean of its divisors is an integer number (87676160).
Almost surely, 2525642141 is an apocalyptic number.
It is an amenable number.
525642141 is a deficient number, since it is larger than the sum of its proper divisors (175767139).
525642141 is a wasteful number, since it uses less digits than its factorization.
525642141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138275.
The product of its digits is 9600, while the sum is 30.
The square root of 525642141 is about 22926.8868580102. The cubic root of 525642141 is about 807.0430933504.
Adding to 525642141 its reverse (141246525), we get a palindrome (666888666).
The spelling of 525642141 in words is "five hundred twenty-five million, six hundred forty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •