Base | Representation |
---|---|
bin | 10000001001101… |
… | …010110100101101 |
3 | 200212212201011202 |
4 | 100021222310231 |
5 | 1023332021112 |
6 | 42515455245 |
7 | 6500131313 |
oct | 2011526455 |
9 | 625781152 |
10 | 270970157 |
11 | 129a56987 |
12 | 768b7525 |
13 | 441a5593 |
14 | 27db80b3 |
15 | 18bc76c2 |
hex | 1026ad2d |
270970157 has 6 divisors (see below), whose sum is σ = 287847498. Its totient is φ = 255030464.
The previous prime is 270970109. The next prime is 270970187. The reversal of 270970157 is 751079072.
It can be written as a sum of positive squares in 3 ways, for example, as 158482921 + 112487236 = 12589^2 + 10606^2 .
It is not a de Polignac number, because 270970157 - 28 = 270969901 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 270970157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (270970187) 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 5 ways as a sum of consecutive naturals, for example, 468518 + ... + 469095.
It is an arithmetic number, because the mean of its divisors is an integer number (47974583).
Almost surely, 2270970157 is an apocalyptic number.
It is an amenable number.
270970157 is a deficient number, since it is larger than the sum of its proper divisors (16877341).
270970157 is an equidigital number, since it uses as much as digits as its factorization.
270970157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 937647 (or 937630 counting only the distinct ones).
The product of its (nonzero) digits is 30870, while the sum is 38.
The square root of 270970157 is about 16461.1711916255. The cubic root of 270970157 is about 647.1036075536.
The spelling of 270970157 in words is "two hundred seventy million, nine hundred seventy thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •