Base | Representation |
---|---|
bin | 100000010111… |
… | …1000110010011 |
3 | 1011221011122101 |
4 | 1000233012103 |
5 | 13321021011 |
6 | 1403421231 |
7 | 264146413 |
oct | 100570623 |
9 | 34834571 |
10 | 16970131 |
11 | 9640a02 |
12 | 5824817 |
13 | 36922c9 |
14 | 237a643 |
15 | 17532c1 |
hex | 102f193 |
16970131 has 4 divisors (see below), whose sum is σ = 17968392. Its totient is φ = 15971872.
The previous prime is 16970117. The next prime is 16970137. The reversal of 16970131 is 13107961.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13107961 = 1993 ⋅6577.
It is a cyclic number.
It is not a de Polignac number, because 16970131 - 25 = 16970099 is a prime.
It is a super-2 number, since 2×169701312 = 575970692314322, 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 16970131.
It is not an unprimeable number, because it can be changed into a prime (16970137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 499105 + ... + 499138.
It is an arithmetic number, because the mean of its divisors is an integer number (4492098).
Almost surely, 216970131 is an apocalyptic number.
16970131 is a deficient number, since it is larger than the sum of its proper divisors (998261).
16970131 is an equidigital number, since it uses as much as digits as its factorization.
16970131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 998260.
The product of its (nonzero) digits is 1134, while the sum is 28.
The square root of 16970131 is about 4119.4818848977. The cubic root of 16970131 is about 256.9774793914.
The spelling of 16970131 in words is "sixteen million, nine hundred seventy thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •