Base | Representation |
---|---|
bin | 10000011111110… |
… | …010110101111100 |
3 | 201021210101022010 |
4 | 100133302311330 |
5 | 1031323121142 |
6 | 43244051220 |
7 | 6600336060 |
oct | 2037626574 |
9 | 637711263 |
10 | 276770172 |
11 | 132258588 |
12 | 78833b10 |
13 | 45456543 |
14 | 28a87aa0 |
15 | 19470e9c |
hex | 107f2d7c |
276770172 has 48 divisors (see below), whose sum is σ = 756064512. Its totient is φ = 77147520.
The previous prime is 276770161. The next prime is 276770189. The reversal of 276770172 is 271077672.
276770172 is an esthetic number in base 13, because in such base its adjacent digits differ by 1.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 276770172.
It is a congruent number.
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, 36738 + ... + 43625.
It is an arithmetic number, because the mean of its divisors is an integer number (15751344).
Almost surely, 2276770172 is an apocalyptic number.
It is an amenable number.
276770172 is an abundant number, since it is smaller than the sum of its proper divisors (479294340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
276770172 is a wasteful number, since it uses less digits than its factorization.
276770172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80418 (or 80416 counting only the distinct ones).
The product of its (nonzero) digits is 57624, while the sum is 39.
The square root of 276770172 is about 16636.4110312291. The cubic root of 276770172 is about 651.6880557020.
The spelling of 276770172 in words is "two hundred seventy-six million, seven hundred seventy thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •