Base | Representation |
---|---|
bin | 1000010110110… |
… | …11101000011111 |
3 | 11212220201211212 |
4 | 10023123220133 |
5 | 120421340011 |
6 | 10542335035 |
7 | 1510613411 |
oct | 413335037 |
9 | 155821755 |
10 | 70105631 |
11 | 36633442 |
12 | 1b58a47b |
13 | 116a792b |
14 | 944c9b1 |
15 | 624c08b |
hex | 42dba1f |
70105631 has 4 divisors (see below), whose sum is σ = 70399200. Its totient is φ = 69812064.
The previous prime is 70105619. The next prime is 70105643. The reversal of 70105631 is 13650107.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (70105619) and next prime (70105643).
It is a cyclic number.
It is not a de Polignac number, because 70105631 - 210 = 70104607 is a prime.
It is a super-2 number, since 2×701056312 = 9829598995816322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 70105597 and 70105606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70105661) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 146426 + ... + 146903.
It is an arithmetic number, because the mean of its divisors is an integer number (17599800).
Almost surely, 270105631 is an apocalyptic number.
70105631 is a deficient number, since it is larger than the sum of its proper divisors (293569).
70105631 is a wasteful number, since it uses less digits than its factorization.
70105631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293568.
The product of its (nonzero) digits is 630, while the sum is 23.
The square root of 70105631 is about 8372.9105453241. The cubic root of 70105631 is about 412.3357284071.
Adding to 70105631 its reverse (13650107), we get a palindrome (83755738).
The spelling of 70105631 in words is "seventy million, one hundred five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •