Base | Representation |
---|---|
bin | 110011101001… |
… | …0100111010000 |
3 | 1212221122202112 |
4 | 1213102213100 |
5 | 23412431242 |
6 | 2404204452 |
7 | 446102621 |
oct | 147224720 |
9 | 55848675 |
10 | 27077072 |
11 | 14314450 |
12 | 9099728 |
13 | 57c0749 |
14 | 384ba48 |
15 | 259cc82 |
hex | 19d29d0 |
27077072 has 40 divisors (see below), whose sum is σ = 59728320. Its totient is φ = 11770880.
The previous prime is 27077069. The next prime is 27077077.
27077072 is nontrivially palindromic in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27077077) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 704 + ... + 7392.
It is an arithmetic number, because the mean of its divisors is an integer number (1493208).
Almost surely, 227077072 is an apocalyptic number.
27077072 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27077072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29864160).
27077072 is an abundant number, since it is smaller than the sum of its proper divisors (32651248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27077072 is a wasteful number, since it uses less digits than its factorization.
27077072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6731 (or 6725 counting only the distinct ones).
The product of its (nonzero) digits is 9604, while the sum is 32.
The square root of 27077072 is about 5203.5633944442. The cubic root of 27077072 is about 300.2851806726.
It can be divided in two parts, 2707 and 7072, that added together give a palindrome (9779).
The spelling of 27077072 in words is "twenty-seven million, seventy-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •