Base | Representation |
---|---|
bin | 1001010101001111… |
… | …1110101001100011 |
3 | 20110120200100100000 |
4 | 2111103332221203 |
5 | 20112242330111 |
6 | 1052323431043 |
7 | 116035336665 |
oct | 22523765143 |
9 | 6416610300 |
10 | 2505042531 |
11 | 1076038592 |
12 | 59ab25483 |
13 | 30bca66b4 |
14 | 19a9a4535 |
15 | e9dc4c56 |
hex | 954fea63 |
2505042531 has 48 divisors (see below), whose sum is σ = 4038679008. Its totient is φ = 1545868800.
The previous prime is 2505042467. The next prime is 2505042541. The reversal of 2505042531 is 1352405052.
It is a happy number.
It is not a de Polignac number, because 2505042531 - 26 = 2505042467 is a prime.
It is a super-2 number, since 2×25050425312 = 12550476164237771922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 2505042495 and 2505042504.
It is not an unprimeable number, because it can be changed into a prime (2505042541) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 247021 + ... + 256961.
It is an arithmetic number, because the mean of its divisors is an integer number (84139146).
Almost surely, 22505042531 is an apocalyptic number.
2505042531 is a deficient number, since it is larger than the sum of its proper divisors (1533636477).
2505042531 is an equidigital number, since it uses as much as digits as its factorization.
2505042531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10034 (or 10022 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The square root of 2505042531 is about 50050.3999084922. The cubic root of 2505042531 is about 1358.1206978064.
Adding to 2505042531 its reverse (1352405052), we get a palindrome (3857447583).
The spelling of 2505042531 in words is "two billion, five hundred five million, forty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •