Base | Representation |
---|---|
bin | 10000000110011… |
… | …110001001111100 |
3 | 200211022010012211 |
4 | 100012132021330 |
5 | 1023123204321 |
6 | 42445510204 |
7 | 6460040242 |
oct | 2006361174 |
9 | 624263184 |
10 | 270131836 |
11 | 129534057 |
12 | 76572364 |
13 | 43c70b30 |
14 | 27c3a792 |
15 | 18aae0e1 |
hex | 1019e27c |
270131836 has 48 divisors (see below), whose sum is σ = 541054080. Its totient is φ = 116904960.
The previous prime is 270131809. The next prime is 270131881. The reversal of 270131836 is 638131072.
270131836 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 270131798 and 270131807.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 380650 + ... + 381358.
It is an arithmetic number, because the mean of its divisors is an integer number (11271960).
Almost surely, 2270131836 is an apocalyptic number.
270131836 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
270131836 is an abundant number, since it is smaller than the sum of its proper divisors (270922244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
270131836 is a wasteful number, since it uses less digits than its factorization.
270131836 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1174 (or 1172 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 31.
The square root of 270131836 is about 16435.6878772992. The cubic root of 270131836 is about 646.4355869485.
The spelling of 270131836 in words is "two hundred seventy million, one hundred thirty-one thousand, eight hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •