Base | Representation |
---|---|
bin | 1001010101010000… |
… | …0001000101110100 |
3 | 20110120200212001102 |
4 | 2111110001011310 |
5 | 20112243140112 |
6 | 1052323545232 |
7 | 116035411103 |
oct | 22524010564 |
9 | 6416625042 |
10 | 2505052532 |
11 | 1076045054 |
12 | 59ab2b218 |
13 | 30bcab108 |
14 | 19a9a803a |
15 | e9dc7bc2 |
hex | 95501174 |
2505052532 has 12 divisors (see below), whose sum is σ = 4394887140. Its totient is φ = 1249370496.
The previous prime is 2505052531. The next prime is 2505052573. The reversal of 2505052532 is 2352505052.
It can be written as a sum of positive squares in 2 ways, for example, as 661724176 + 1843328356 = 25724^2 + 42934^2 .
It is a super-2 number, since 2×25050525322 = 12550576376159222048, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2505052495 and 2505052504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2505052531) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 787157 + ... + 790332.
It is an arithmetic number, because the mean of its divisors is an integer number (366240595).
Almost surely, 22505052532 is an apocalyptic number.
It is an amenable number.
2505052532 is a deficient number, since it is larger than the sum of its proper divisors (1889834608).
2505052532 is a wasteful number, since it uses less digits than its factorization.
2505052532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1577890 (or 1577888 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 29.
The square root of 2505052532 is about 50050.4998176841. The cubic root of 2505052532 is about 1358.1225051672.
Adding to 2505052532 its reverse (2352505052), we get a palindrome (4857557584).
The spelling of 2505052532 in words is "two billion, five hundred five million, fifty-two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •