Base | Representation |
---|---|
bin | 111101001000… |
… | …000101111011 |
3 | 1010011002200221 |
4 | 331020011323 |
5 | 13100231211 |
6 | 1331240511 |
7 | 253126000 |
oct | 75100573 |
9 | 33132627 |
10 | 16023931 |
11 | 9055020 |
12 | 5449137 |
13 | 3420721 |
14 | 21b18a7 |
15 | 1617c71 |
hex | f4817b |
16023931 has 32 divisors (see below), whose sum is σ = 21196800. Its totient is φ = 11995200.
The previous prime is 16023881. The next prime is 16023937. The reversal of 16023931 is 13932061.
It is not a de Polignac number, because 16023931 - 27 = 16023803 is a prime.
It is a super-2 number, since 2×160239312 = 513532729385522, 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 = 16023896 and 16023905.
It is not an unprimeable number, because it can be changed into a prime (16023937) 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 31 ways as a sum of consecutive naturals, for example, 116895 + ... + 117031.
It is an arithmetic number, because the mean of its divisors is an integer number (662400).
Almost surely, 216023931 is an apocalyptic number.
16023931 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
16023931 is a deficient number, since it is larger than the sum of its proper divisors (5172869).
16023931 is a wasteful number, since it uses less digits than its factorization.
16023931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200 (or 186 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 25.
The square root of 16023931 is about 4002.9902572952. The cubic root of 16023931 is about 252.1097772743.
Adding to 16023931 its reverse (13932061), we get a palindrome (29955992).
The spelling of 16023931 in words is "sixteen million, twenty-three thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •