Base | Representation |
---|---|
bin | 1000010111010… |
… | …11001000101011 |
3 | 11220000221221201 |
4 | 10023223020223 |
5 | 120430403011 |
6 | 10543545031 |
7 | 1511266504 |
oct | 413531053 |
9 | 156027851 |
10 | 70169131 |
11 | 3667711a |
12 | 1b5bb177 |
13 | 116ca7c6 |
14 | 9467bab |
15 | 6260cc1 |
hex | 42eb22b |
70169131 has 4 divisors (see below), whose sum is σ = 72065632. Its totient is φ = 68272632.
The previous prime is 70169123. The next prime is 70169137. The reversal of 70169131 is 13196107.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 70169131 - 23 = 70169123 is a prime.
It is a super-2 number, since 2×701691312 = 9847413890590322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 70169131.
It is not an unprimeable number, because it can be changed into a prime (70169137) 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, 948195 + ... + 948268.
It is an arithmetic number, because the mean of its divisors is an integer number (18016408).
Almost surely, 270169131 is an apocalyptic number.
70169131 is a deficient number, since it is larger than the sum of its proper divisors (1896501).
70169131 is a wasteful number, since it uses less digits than its factorization.
70169131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1896500.
The product of its (nonzero) digits is 1134, while the sum is 28.
The square root of 70169131 is about 8376.7016778682. The cubic root of 70169131 is about 412.4601854440.
The spelling of 70169131 in words is "seventy million, one hundred sixty-nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •