Base | Representation |
---|---|
bin | 111100000011100… |
… | …1100100100101001 |
3 | 12012102212100110000 |
4 | 1320013030210221 |
5 | 13111334334200 |
6 | 531543413213 |
7 | 100636340646 |
oct | 17007144451 |
9 | 5172770400 |
10 | 2015152425 |
11 | 944556930 |
12 | 482a54209 |
13 | 2616511b0 |
14 | 1518c0dcd |
15 | bbda7300 |
hex | 781cc929 |
2015152425 has 120 divisors (see below), whose sum is σ = 4385969280. Its totient is φ = 901756800.
The previous prime is 2015152421. The next prime is 2015152439. The reversal of 2015152425 is 5242515102.
It is not a de Polignac number, because 2015152425 - 22 = 2015152421 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (2015152421) by changing a digit.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 286096 + ... + 293054.
It is an arithmetic number, because the mean of its divisors is an integer number (36549744).
Almost surely, 22015152425 is an apocalyptic number.
2015152425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2015152425 is an abundant number, since it is smaller than the sum of its proper divisors (2370816855).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2015152425 is a wasteful number, since it uses less digits than its factorization.
2015152425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7005 (or 6991 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
The square root of 2015152425 is about 44890.4491512393. The cubic root of 2015152425 is about 1263.0948580590.
Adding to 2015152425 its reverse (5242515102), we get a palindrome (7257667527).
The spelling of 2015152425 in words is "two billion, fifteen million, one hundred fifty-two thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •