Base | Representation |
---|---|
bin | 10000001000101… |
… | …011011100011000 |
3 | 200212101112001202 |
4 | 100020223130120 |
5 | 1023300214202 |
6 | 42510133332 |
7 | 6465000410 |
oct | 2010533430 |
9 | 625345052 |
10 | 270710552 |
11 | 129899932 |
12 | 767b1248 |
13 | 44114378 |
14 | 27d4b640 |
15 | 18b75802 |
hex | 1022b718 |
270710552 has 64 divisors (see below), whose sum is σ = 614545920. Its totient is φ = 109283328.
The previous prime is 270710549. The next prime is 270710579. The reversal of 270710552 is 255017072.
270710552 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 15 ways as a sum of consecutive naturals, for example, 84728 + ... + 87864.
It is an arithmetic number, because the mean of its divisors is an integer number (9602280).
Almost surely, 2270710552 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 270710552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (307272960).
270710552 is an abundant number, since it is smaller than the sum of its proper divisors (343835368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
270710552 is a wasteful number, since it uses less digits than its factorization.
270710552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3240 (or 3236 counting only the distinct ones).
The product of its (nonzero) digits is 4900, while the sum is 29.
The square root of 270710552 is about 16453.2839275325. The cubic root of 270710552 is about 646.8968873610.
The spelling of 270710552 in words is "two hundred seventy million, seven hundred ten thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •