Base | Representation |
---|---|
bin | 1000010110011… |
… | …01110101111111 |
3 | 11212210212101000 |
4 | 10023031311333 |
5 | 120413033101 |
6 | 10541221343 |
7 | 1510256634 |
oct | 413156577 |
9 | 155725330 |
10 | 70049151 |
11 | 365a4a67 |
12 | 1b561853 |
13 | 11688003 |
14 | 943618b |
15 | 623a486 |
hex | 42cdd7f |
70049151 has 8 divisors (see below), whose sum is σ = 103776560. Its totient is φ = 46699416.
The previous prime is 70049149. The next prime is 70049153. The reversal of 70049151 is 15194007.
It is an interprime number because it is at equal distance from previous prime (70049149) and next prime (70049153).
It is not a de Polignac number, because 70049151 - 21 = 70049149 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 2594413 = 70049151 / (7 + 0 + 0 + 4 + 9 + 1 + 5 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70049153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1297180 + ... + 1297233.
It is an arithmetic number, because the mean of its divisors is an integer number (12972070).
Almost surely, 270049151 is an apocalyptic number.
70049151 is a deficient number, since it is larger than the sum of its proper divisors (33727409).
70049151 is a wasteful number, since it uses less digits than its factorization.
70049151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2594422 (or 2594416 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 70049151 is about 8369.5370839730. The cubic root of 70049151 is about 412.2249670767.
The spelling of 70049151 in words is "seventy million, forty-nine thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •