Base | Representation |
---|---|
bin | 111101100001… |
… | …000001001111 |
3 | 1010100021202102 |
4 | 331201001033 |
5 | 13112013111 |
6 | 1333345315 |
7 | 254032445 |
oct | 75410117 |
9 | 33307672 |
10 | 16126031 |
11 | 91147a9 |
12 | 549823b |
13 | 345803c |
14 | 21dab95 |
15 | 163813b |
hex | f6104f |
16126031 has 4 divisors (see below), whose sum is σ = 16159632. Its totient is φ = 16092432.
The previous prime is 16125971. The next prime is 16126037. The reversal of 16126031 is 13062161.
16126031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 16126031 - 222 = 11931727 is a prime.
It is a super-2 number, since 2×161260312 = 520097751625922, 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 = 16125994 and 16126012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16126037) 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, 16070 + ... + 17043.
It is an arithmetic number, because the mean of its divisors is an integer number (4039908).
Almost surely, 216126031 is an apocalyptic number.
16126031 is a deficient number, since it is larger than the sum of its proper divisors (33601).
16126031 is an equidigital number, since it uses as much as digits as its factorization.
16126031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33600.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 16126031 is about 4015.7229735130. The cubic root of 16126031 is about 252.6441016491.
Adding to 16126031 its reverse (13062161), we get a palindrome (29188192).
The spelling of 16126031 in words is "sixteen million, one hundred twenty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •