Base | Representation |
---|---|
bin | 110011110001… |
… | …1101011100000 |
3 | 1220002012122120 |
4 | 1213203223200 |
5 | 23422200401 |
6 | 2405504240 |
7 | 446513463 |
oct | 147435340 |
9 | 56065576 |
10 | 27146976 |
11 | 14361a1a |
12 | 9112080 |
13 | 58164cc |
14 | 38692da |
15 | 25b3836 |
hex | 19e3ae0 |
27146976 has 48 divisors (see below), whose sum is σ = 72140544. Its totient is φ = 8937344.
The previous prime is 27146957. The next prime is 27146981. The reversal of 27146976 is 67964172.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-3 number, since 3×271469763 (a number of 23 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6265 + ... + 9671.
It is an arithmetic number, because the mean of its divisors is an integer number (1502928).
Almost surely, 227146976 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 27146976, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36070272).
27146976 is an abundant number, since it is smaller than the sum of its proper divisors (44993568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27146976 is a wasteful number, since it uses less digits than its factorization.
27146976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3503 (or 3495 counting only the distinct ones).
The product of its digits is 127008, while the sum is 42.
The square root of 27146976 is about 5210.2760003670. The cubic root of 27146976 is about 300.5433707887.
The spelling of 27146976 in words is "twenty-seven million, one hundred forty-six thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •