Base | Representation |
---|---|
bin | 111100000011100… |
… | …0110000000110000 |
3 | 12012102210222120201 |
4 | 1320013012000300 |
5 | 13111333004202 |
6 | 531543044544 |
7 | 100636166416 |
oct | 17007060060 |
9 | 5172728521 |
10 | 2015125552 |
11 | 944538720 |
12 | 482a40754 |
13 | 261641bab |
14 | 1518b52b6 |
15 | bbd9e387 |
hex | 781c6030 |
2015125552 has 40 divisors (see below), whose sum is σ = 4406124240. Its totient is φ = 884378880.
The previous prime is 2015125547. The next prime is 2015125559. The reversal of 2015125552 is 2555215102.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 2015125552.
It is not an unprimeable number, because it can be changed into a prime (2015125559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 192303 + ... + 202510.
It is an arithmetic number, because the mean of its divisors is an integer number (110153106).
Almost surely, 22015125552 is an apocalyptic number.
2015125552 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2015125552 is an abundant number, since it is smaller than the sum of its proper divisors (2390998688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2015125552 is a wasteful number, since it uses less digits than its factorization.
2015125552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394861 (or 394855 counting only the distinct ones).
The product of its (nonzero) digits is 5000, while the sum is 28.
The square root of 2015125552 is about 44890.1498326749. The cubic root of 2015125552 is about 1263.0892433805.
The spelling of 2015125552 in words is "two billion, fifteen million, one hundred twenty-five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •