Base | Representation |
---|---|
bin | 1000011011001… |
… | …01100110001011 |
3 | 11220222110000111 |
4 | 10031211212023 |
5 | 121042430411 |
6 | 11002415151 |
7 | 1515456055 |
oct | 415454613 |
9 | 156873014 |
10 | 70670731 |
11 | 36989a6a |
12 | 1b8014b7 |
13 | 11844c01 |
14 | 95588d5 |
15 | 630e721 |
hex | 436598b |
70670731 has 8 divisors (see below), whose sum is σ = 74188800. Its totient is φ = 67230120.
The previous prime is 70670723. The next prime is 70670741. The reversal of 70670731 is 13707607.
It is a happy number.
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 70670731 - 23 = 70670723 is a prime.
It is a super-2 number, since 2×706707312 = 9988704440148722, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 70670693 and 70670702.
It is not an unprimeable number, because it can be changed into a prime (70670711) 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 7 ways as a sum of consecutive naturals, for example, 17491 + ... + 21148.
It is an arithmetic number, because the mean of its divisors is an integer number (9273600).
Almost surely, 270670731 is an apocalyptic number.
70670731 is a deficient number, since it is larger than the sum of its proper divisors (3518069).
70670731 is a wasteful number, since it uses less digits than its factorization.
70670731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38729.
The product of its (nonzero) digits is 6174, while the sum is 31.
The square root of 70670731 is about 8406.5885470861. The cubic root of 70670731 is about 413.4406688090.
The spelling of 70670731 in words is "seventy million, six hundred seventy thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •