Base | Representation |
---|---|
bin | 110011100111… |
… | …1100001011000 |
3 | 1212221000101111 |
4 | 1213033201120 |
5 | 23412030113 |
6 | 2404030104 |
7 | 446020660 |
oct | 147174130 |
9 | 55830344 |
10 | 27064408 |
11 | 14305988 |
12 | 9092334 |
13 | 57b7a57 |
14 | 38471a0 |
15 | 259913d |
hex | 19cf858 |
27064408 has 32 divisors (see below), whose sum is σ = 61408800. Its totient is φ = 10916352.
The previous prime is 27064403. The next prime is 27064409. The reversal of 27064408 is 80446072.
It is a self number, because there is not a number n which added to its sum of digits gives 27064408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27064403) 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, 13263 + ... + 15166.
It is an arithmetic number, because the mean of its divisors is an integer number (1919025).
Almost surely, 227064408 is an apocalyptic number.
27064408 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
27064408 is an abundant number, since it is smaller than the sum of its proper divisors (34344392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27064408 is a wasteful number, since it uses less digits than its factorization.
27064408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28459 (or 28455 counting only the distinct ones).
The product of its (nonzero) digits is 10752, while the sum is 31.
The square root of 27064408 is about 5202.3463936958. The cubic root of 27064408 is about 300.2383587151.
It can be divided in two parts, 27064 and 408, that added together give a palindrome (27472).
The spelling of 27064408 in words is "twenty-seven million, sixty-four thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •