Base | Representation |
---|---|
bin | 1011100000000001… |
… | …1010001001010000 |
3 | 21222010221200102101 |
4 | 2320000122021100 |
5 | 22310300133312 |
6 | 1230155330144 |
7 | 136334020534 |
oct | 27000321120 |
9 | 7863850371 |
10 | 3087114832 |
11 | 134466107a |
12 | 721a50954 |
13 | 3a2766189 |
14 | 214001bc4 |
15 | 131050a57 |
hex | b801a250 |
3087114832 has 80 divisors (see below), whose sum is σ = 6747960960. Its totient is φ = 1360820736.
The previous prime is 3087114829. The next prime is 3087114853. The reversal of 3087114832 is 2384117803.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a junction number, because it is equal to n+sod(n) for n = 3087114791 and 3087114800.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 252738 + ... + 264670.
It is an arithmetic number, because the mean of its divisors is an integer number (84349512).
Almost surely, 23087114832 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 3087114832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3373980480).
3087114832 is an abundant number, since it is smaller than the sum of its proper divisors (3660846128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3087114832 is a wasteful number, since it uses less digits than its factorization.
3087114832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12020 (or 12014 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 37.
The square root of 3087114832 is about 55561.8109136122. The cubic root of 3087114832 is about 1456.0767303483.
The spelling of 3087114832 in words is "three billion, eighty-seven million, one hundred fourteen thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •