Base | Representation |
---|---|
bin | 10000001010111… |
… | …110100011111101 |
3 | 200220112010200011 |
4 | 100022332203331 |
5 | 1023424010044 |
6 | 42531103221 |
7 | 6503060302 |
oct | 2012764375 |
9 | 626463604 |
10 | 271313149 |
11 | 12a170648 |
12 | 76a41b11 |
13 | 44295733 |
14 | 280670a9 |
15 | 18c44134 |
hex | 102be8fd |
271313149 has 8 divisors (see below), whose sum is σ = 287453880. Its totient is φ = 255192576.
The previous prime is 271313143. The next prime is 271313213. The reversal of 271313149 is 941313172.
It can be written as a sum of positive squares in 4 ways, for example, as 710649 + 270602500 = 843^2 + 16450^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 271313149 - 25 = 271313117 is a prime.
It is a super-2 number, since 2×2713131492 = 147221649640592402, which contains 22 as substring.
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 271313149.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (271313143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29497 + ... + 37585.
It is an arithmetic number, because the mean of its divisors is an integer number (35931735).
Almost surely, 2271313149 is an apocalyptic number.
It is an amenable number.
271313149 is a deficient number, since it is larger than the sum of its proper divisors (16140731).
271313149 is a wasteful number, since it uses less digits than its factorization.
271313149 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10079.
The product of its digits is 4536, while the sum is 31.
The square root of 271313149 is about 16471.5861106331. The cubic root of 271313149 is about 647.3765254039.
The spelling of 271313149 in words is "two hundred seventy-one million, three hundred thirteen thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •