Base | Representation |
---|---|
bin | 1000010110100… |
… | …10101110001011 |
3 | 11212211212210000 |
4 | 10023102232023 |
5 | 120414203011 |
6 | 10541454043 |
7 | 1510402116 |
oct | 413225613 |
9 | 155755700 |
10 | 70069131 |
11 | 36608a80 |
12 | 1b571323 |
13 | 11694132 |
14 | 943d57d |
15 | 6241356 |
hex | 42d2b8b |
70069131 has 40 divisors (see below), whose sum is σ = 120225600. Its totient is φ = 40221360.
The previous prime is 70069117. The next prime is 70069159. The reversal of 70069131 is 13196007.
It is not a de Polignac number, because 70069131 - 25 = 70069099 is a prime.
It is a super-2 number, since 2×700691312 = 9819366238190322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 70069095 and 70069104.
It is not an unprimeable number, because it can be changed into a prime (70069171) 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 39 ways as a sum of consecutive naturals, for example, 14860 + ... + 18998.
It is an arithmetic number, because the mean of its divisors is an integer number (3005640).
Almost surely, 270069131 is an apocalyptic number.
70069131 is a deficient number, since it is larger than the sum of its proper divisors (50156469).
70069131 is a wasteful number, since it uses less digits than its factorization.
70069131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4181 (or 4172 counting only the distinct ones).
The product of its (nonzero) digits is 1134, while the sum is 27.
The square root of 70069131 is about 8370.7306132738. The cubic root of 70069131 is about 412.2641560927.
The spelling of 70069131 in words is "seventy million, sixty-nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •