Base | Representation |
---|---|
bin | 1011101111000000111000 |
3 | 12210021200120 |
4 | 23233000320 |
5 | 1241414102 |
6 | 145533240 |
7 | 35101242 |
oct | 13570070 |
9 | 5707616 |
10 | 3076152 |
11 | 1811182 |
12 | 1044220 |
13 | 839211 |
14 | 5a1092 |
15 | 40b6bc |
hex | 2ef038 |
3076152 has 16 divisors (see below), whose sum is σ = 7690440. Its totient is φ = 1025376.
The previous prime is 3076141. The next prime is 3076153. The reversal of 3076152 is 2516703.
3076152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×30761522 = 18925422254208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 128173 = 3076152 / (3 + 0 + 7 + 6 + 1 + 5 + 2).
It is an Ulam number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3076153) 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 3 ways as a sum of consecutive naturals, for example, 64063 + ... + 64110.
Almost surely, 23076152 is an apocalyptic number.
It is an amenable number.
3076152 is an abundant number, since it is smaller than the sum of its proper divisors (4614288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3076152 is a wasteful number, since it uses less digits than its factorization.
3076152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128182 (or 128178 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 24.
The square root of 3076152 is about 1753.8962341028. The cubic root of 3076152 is about 145.4351099979.
The spelling of 3076152 in words is "three million, seventy-six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •