Base | Representation |
---|---|
bin | 10000000110000… |
… | …100110101110111 |
3 | 200211002211222122 |
4 | 100012010311313 |
5 | 1023111400101 |
6 | 42443350155 |
7 | 6456126041 |
oct | 2006046567 |
9 | 624084878 |
10 | 270028151 |
11 | 129473168 |
12 | 7652235b |
13 | 43c35893 |
14 | 27c10a91 |
15 | 18a8d51b |
hex | 10184d77 |
270028151 has 8 divisors (see below), whose sum is σ = 275094000. Its totient is φ = 264983040.
The previous prime is 270028147. The next prime is 270028159. The reversal of 270028151 is 151820072.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 270028151 - 22 = 270028147 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 270028151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (270028159) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 22460 + ... + 32318.
It is an arithmetic number, because the mean of its divisors is an integer number (34386750).
Almost surely, 2270028151 is an apocalyptic number.
270028151 is a deficient number, since it is larger than the sum of its proper divisors (5065849).
270028151 is an equidigital number, since it uses as much as digits as its factorization.
270028151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10369.
The product of its (nonzero) digits is 1120, while the sum is 26.
The square root of 270028151 is about 16432.5333104789. The cubic root of 270028151 is about 646.3528690034.
It can be divided in two parts, 27002 and 8151, that added together give a palindrome (35153).
The spelling of 270028151 in words is "two hundred seventy million, twenty-eight thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •