Base | Representation |
---|---|
bin | 110100011010… |
… | …1001111101000 |
3 | 1220201011221012 |
4 | 1220311033220 |
5 | 24013343224 |
6 | 2421003052 |
7 | 452404502 |
oct | 150651750 |
9 | 56634835 |
10 | 27481064 |
11 | 1456aa26 |
12 | 9253488 |
13 | 59025b0 |
14 | 3914d72 |
15 | 262c80e |
hex | 1a353e8 |
27481064 has 32 divisors (see below), whose sum is σ = 56133000. Its totient is φ = 12536832.
The previous prime is 27481063. The next prime is 27481073. The reversal of 27481064 is 46018472.
It can be written as a sum of positive squares in 4 ways, for example, as 5484964 + 21996100 = 2342^2 + 4690^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 27481064.
It is not an unprimeable number, because it can be changed into a prime (27481063) by changing a digit.
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, 7772 + ... + 10740.
Almost surely, 227481064 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 27481064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28066500).
27481064 is an abundant number, since it is smaller than the sum of its proper divisors (28651936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27481064 is a wasteful number, since it uses less digits than its factorization.
27481064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3077 (or 3073 counting only the distinct ones).
The product of its (nonzero) digits is 10752, while the sum is 32.
The square root of 27481064 is about 5242.2384531801. The cubic root of 27481064 is about 301.7712402968.
The spelling of 27481064 in words is "twenty-seven million, four hundred eighty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •