Recognised as Number

16,238

Positive
Even
Composite
5 digits

16,238 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value16,238

Digit count5

Digit sum20

Digit product288

Multiplicative persistence4times the digit product can be taken before one digit is left

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 23 × 353

Distinct prime factors32, 23, 353

Number of divisors8

Sum of divisors σ(n)25,488

Aliquot sum9,250sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)7,744integers below n that share no factor with it

Carmichael function λ(n)352the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 7,744

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 23, 46, 353, 706, 8,119, 16,2388 in total

Arithmetic

Previous number16,237

Next number16,239

Double32,476

Half8,119

Square263,672,644

Cube4,281,516,393,272

Square root127.428411275≈irrational, shown to 9 decimal places

Cube root25.322748733≈

Negation-16,238

Reciprocal0.0000615839≈

Representations

Decimal16,238

Binary1111110110111014 bits

Octal37556

Hexadecimal3F6E

Base 36CJ2

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordssixteen thousand, two hundred and thirty-eight

Ordinalsixteen thousand, two hundred and thirty-eighth

Scientific notation1.6238 × 10^4

Engineering notation16.238 × 10^3

In other bases

Ternary211021102base 3; the most digit-efficient integer base after e: 9 digits

Quinary1004423base 5; one hand: 7 digits

Septenary65225base 7: 5 digits

Nonary24242base 9; each digit is two ternary digits: 5 digits

Duodecimal9492base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits

Vigesimal20bibase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal4:30:38base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1T111T111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary100000010110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011111101101110

Bit length14 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits3within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being even

Highest set bitbit 13worth 8,192

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes23f 6e

Gray code10000011011001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011111101101110

32-bit00000000000000000011111101101110

64-bit0000000000000000000000000000000000000000000000000011111101101110

One's complement1100000010010001at 16 bits, every bit flipped

Bits reversed0111011011111100at 16 bits

Rotated left by 10111111011011100at 16 bits, wrapping

Shifted left by 1111111011011100= 32,476, no wrap

Shifted right by 11111110110111= 8,119, discarding the low bit

These bits as a double8.02263796 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime16,249+11

Previous prime16,231−7

Distance to nearest prime7

Nearest square below16,129

Nearest square above16,384

Powers & multiples

16,238 to the power 2263,672,644

16,238 to the power 34,281,516,393,272

16,238 to the power 469,523,263,193,950,736

16,238 to the power 51,128,918,747,743,372,051,168

First ten multiples16,238, 32,476, 48,714, 64,952, 81,190, 97,428, 113,666, 129,904, 146,142, 162,380

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 3

Divisible by 6No, remainder 2

Divisible by 7No, remainder 5

Divisible by 8No, remainder 6

Divisible by 9No, remainder 2

Divisible by 10No, remainder 8

Divisible by 11No, remainder 2

Divisible by 12No, remainder 2

Divisible by 100No, remainder 38

Collatz (3n + 1) trajectory

Steps to reach 166the total stopping time

Highest value reached54,8083× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps16,238 → 8,119 → 24,358 → 12,179 → 36,538 → 18,269 → 54,808 → 27,404 → 13,702 → 6,851 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,623,800%

16,238% as a decimal162.38

16,238% of 10016,238

16,238% of 1,000162,380

As a fraction of 10016,238/100

Read another way

As seconds4 hours, 30 minutes and 38 seconds

As bytes15.857 KiB

As a 24-bit colour#003F6E

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.