Nerdulator> put something in

Recognised as Number

16,428

  • Positive
  • Even
  • Composite
  • 5 digits

16,428 is an even 5-digit integer and a composite number. It has 18 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value16,428
Digit count5
Digit sum21
Digit product384
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3 × 37^2
Distinct prime factors32, 3, 37
Number of divisors18
Sum of divisors σ(n)39,396
Aliquot sum22,968sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)5,328integers below n that share no factor with it
Carmichael function λ(n)1,332the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,328
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 12, 37, 74, 111, 148, 222, 444, 1,369, 2,738, 4,107, 5,476, 8,214, 16,42818 in total

Arithmetic

Previous number16,427
Next number16,429
Double32,856
Half8,214
Square root128.17175976≈irrational, shown to 9 decimal places
Cube root25.421132722≈
Negation-16,428
Reciprocal0.0000608717≈

Representations

Decimal16,428
Binary10000000010110015 bits
Octal40054
Hexadecimal402C
Base 36COC
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixteen thousand, four hundred and twenty-eight
Ordinalsixteen thousand, four hundred and twenty-eighth
Scientific notation1.6428 × 10^4
Engineering notation16.428 × 10^3

In other bases

Ternary211112110base 3; the most digit-efficient integer base after e: 9 digits
Quinary1011203base 5; one hand: 7 digits
Septenary65616base 7: 5 digits
Nonary24473base 9; each digit is two ternary digits: 5 digits
Duodecimal9610base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal2118base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:33:48base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10TTTTT110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000001111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0100000000101100
Bit length15 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits11within that length
Bit parityeven4 set bits, so even; not the same as the number itself being even
Highest set bitbit 14worth 16,384
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes240 2c
Gray code110000000111010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100000000101100
32-bit00000000000000000100000000101100
64-bit0000000000000000000000000000000000000000000000000100000000101100
One's complement1011111111010011at 16 bits, every bit flipped
Bits reversed0011010000000010at 16 bits
Rotated left by 11000000001011000at 16 bits, wrapping
Shifted left by 11000000001011000= 32,856, no wrap
Shifted right by 110000000010110= 8,214, discarding the low bit
These bits as a double8.11651043 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime16,433+5
Previous prime16,427−1
Distance to nearest prime1
Nearest square below16,384
Nearest square above16,641

Powers & multiples

16,428 to the power 2269,879,184
16,428 to the power 34,433,575,234,752
16,428 to the power 472,834,773,956,505,856
16,428 to the power 51,196,529,666,557,478,202,368
First ten multiples16,428, 32,856, 49,284, 65,712, 82,140, 98,568, 114,996, 131,424, 147,852, 164,280
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 3
Divisible by 10No, remainder 8
Divisible by 11No, remainder 5
Divisible by 12Yes
Divisible by 100No, remainder 28

Collatz (3n + 1) trajectory

Steps to reach 140the total stopping time
Highest value reached18,4841× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps16,428 → 8,214 → 4,107 → 12,322 → 6,161 → 18,484 → 9,242 → 4,621 → 13,864 → 6,932 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,642,800%
16,428% as a decimal164.28
16,428% of 10016,428
16,428% of 1,000164,280
As a fraction of 10016,428/100

Read another way

As bytes16.043 KiB
As a 24-bit colour#00402C

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “16428” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.