Base | Representation |
---|---|
bin | 1000011001010… |
… | …10101010100111 |
3 | 11220112011220111 |
4 | 10030222222213 |
5 | 121012214401 |
6 | 10553313451 |
7 | 1513432246 |
oct | 414525247 |
9 | 156464814 |
10 | 70429351 |
11 | 36834683 |
12 | 1b705887 |
13 | 1178c095 |
14 | 94d495d |
15 | 62b2e51 |
hex | 432aaa7 |
70429351 has 4 divisors (see below), whose sum is σ = 74572272. Its totient is φ = 66286432.
The previous prime is 70429343. The next prime is 70429393. The reversal of 70429351 is 15392407.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15392407 = 37 ⋅416011.
It is a cyclic number.
It is not a de Polignac number, because 70429351 - 23 = 70429343 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70427351) 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 3 ways as a sum of consecutive naturals, for example, 2071435 + ... + 2071468.
It is an arithmetic number, because the mean of its divisors is an integer number (18643068).
Almost surely, 270429351 is an apocalyptic number.
70429351 is a deficient number, since it is larger than the sum of its proper divisors (4142921).
70429351 is a wasteful number, since it uses less digits than its factorization.
70429351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4142920.
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 70429351 is about 8392.2196706235. The cubic root of 70429351 is about 412.9694216447.
The spelling of 70429351 in words is "seventy million, four hundred twenty-nine thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •