Base | Representation |
---|---|
bin | 110011101011… |
… | …1100110111100 |
3 | 1212222200211022 |
4 | 1213113212330 |
5 | 23414110112 |
6 | 2404443312 |
7 | 446216360 |
oct | 147274674 |
9 | 55880738 |
10 | 27097532 |
11 | 14328860 |
12 | 90a9538 |
13 | 57c9b57 |
14 | 38552a0 |
15 | 25a3d72 |
hex | 19d79bc |
27097532 has 48 divisors (see below), whose sum is σ = 59797248. Its totient is φ = 10437120.
The previous prime is 27097531. The next prime is 27097537. The reversal of 27097532 is 23579072.
It is a junction number, because it is equal to n+sod(n) for n = 27097492 and 27097501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27097531) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29423 + ... + 30329.
It is an arithmetic number, because the mean of its divisors is an integer number (1245776).
Almost surely, 227097532 is an apocalyptic number.
27097532 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 27097532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29898624).
27097532 is an abundant number, since it is smaller than the sum of its proper divisors (32699716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27097532 is a wasteful number, since it uses less digits than its factorization.
27097532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1026 (or 1024 counting only the distinct ones).
The product of its (nonzero) digits is 26460, while the sum is 35.
The square root of 27097532 is about 5205.5289836865. The cubic root of 27097532 is about 300.3607955443.
The spelling of 27097532 in words is "twenty-seven million, ninety-seven thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •