Base | Representation |
---|---|
bin | 1010000110110111… |
… | …0111111000011011 |
3 | 21000002021122220202 |
4 | 2201231313320123 |
5 | 21024032012042 |
6 | 1125120212415 |
7 | 124143312101 |
oct | 24155677033 |
9 | 7002248822 |
10 | 2713157147 |
11 | 1172563138 |
12 | 63876a10b |
13 | 34314233c |
14 | 1ba499c71 |
15 | 10d2d3632 |
hex | a1b77e1b |
2713157147 has 8 divisors (see below), whose sum is σ = 2811098640. Its totient is φ = 2615508000.
The previous prime is 2713157131. The next prime is 2713157173. The reversal of 2713157147 is 7417513172.
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 2713157147 - 24 = 2713157131 is a prime.
It is a super-2 number, since 2×27131571472 = 14722443408634359218, 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 2713157147.
It is not an unprimeable number, because it can be changed into a prime (2713157047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54104 + ... + 91397.
It is an arithmetic number, because the mean of its divisors is an integer number (351387330).
Almost surely, 22713157147 is an apocalyptic number.
2713157147 is a deficient number, since it is larger than the sum of its proper divisors (97941493).
2713157147 is a wasteful number, since it uses less digits than its factorization.
2713157147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146173.
The product of its digits is 41160, while the sum is 38.
The square root of 2713157147 is about 52087.9750710277. The cubic root of 2713157147 is about 1394.7348402980.
The spelling of 2713157147 in words is "two billion, seven hundred thirteen million, one hundred fifty-seven thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •