Base | Representation |
---|---|
bin | 10000001000100… |
… | …110100011111000 |
3 | 200212100111122000 |
4 | 100020212203320 |
5 | 1023244044202 |
6 | 42505501000 |
7 | 6464555166 |
oct | 2010464370 |
9 | 625314560 |
10 | 270690552 |
11 | 129885900 |
12 | 767a1760 |
13 | 44108232 |
14 | 27d44236 |
15 | 18b6e91c |
hex | 102268f8 |
270690552 has 96 divisors (see below), whose sum is σ = 826568400. Its totient is φ = 82019520.
The previous prime is 270690533. The next prime is 270690593. The reversal of 270690552 is 255096072.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20958 + ... + 31314.
Almost surely, 2270690552 is an apocalyptic number.
270690552 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 270690552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (413284200).
270690552 is an abundant number, since it is smaller than the sum of its proper divisors (555877848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
270690552 is a wasteful number, since it uses less digits than its factorization.
270690552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10394 (or 10373 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 36.
The square root of 270690552 is about 16452.6761349028. The cubic root of 270690552 is about 646.8809561308.
The spelling of 270690552 in words is "two hundred seventy million, six hundred ninety thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •