Base | Representation |
---|---|
bin | 1011100110101100… |
… | …1011101001101000 |
3 | 22001002121201112112 |
4 | 2321223023221220 |
5 | 22334431323442 |
6 | 1233035301452 |
7 | 140123645255 |
oct | 27153135150 |
9 | 8032551475 |
10 | 3115104872 |
11 | 1359439440 |
12 | 72b2aa888 |
13 | 3a84b6329 |
14 | 217a0a42c |
15 | 13372e082 |
hex | b9acba68 |
3115104872 has 64 divisors (see below), whose sum is σ = 6788275200. Its totient is φ = 1325211840.
The previous prime is 3115104859. The next prime is 3115104893. The reversal of 3115104872 is 2784015113.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 127553 + ... + 149999.
It is an arithmetic number, because the mean of its divisors is an integer number (106066800).
Almost surely, 23115104872 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3115104872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3394137600).
3115104872 is an abundant number, since it is smaller than the sum of its proper divisors (3673170328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3115104872 is a wasteful number, since it uses less digits than its factorization.
3115104872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22566 (or 22562 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 32.
The square root of 3115104872 is about 55813.1245496971. The cubic root of 3115104872 is about 1460.4641159117.
Adding to 3115104872 its reverse (2784015113), we get a palindrome (5899119985).
The spelling of 3115104872 in words is "three billion, one hundred fifteen million, one hundred four thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •