Nerdulator> put something in

Recognised as Number

16,402

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value16,402
Digit count5
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 59 × 139
Distinct prime factors32, 59, 139
Number of divisors8
Sum of divisors σ(n)25,200
Aliquot sum8,798sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,004integers below n that share no factor with it
Carmichael function λ(n)4,002the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,004
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 59, 118, 139, 278, 8,201, 16,4028 in total

Arithmetic

Previous number16,401
Next number16,403
Double32,804
Half8,201
Square root128.070293199≈irrational, shown to 9 decimal places
Cube root25.407714605≈
Negation-16,402
Reciprocal0.0000609682≈

Representations

Decimal16,402
Binary10000000001001015 bits
Octal40022
Hexadecimal4012
Base 36CNM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixteen thousand, four hundred and two
Ordinalsixteen thousand, four hundred and second
Scientific notation1.6402 × 10^4
Engineering notation16.402 × 10^3

In other bases

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

Bit-level

0100000000010010
Bit length15 bitsto write the magnitude
Set bits3the population count, or Hamming weight
Zero bits12within that length
Bit parityodd3 set bits, so odd; not the same as the number itself being even
Highest set bitbit 14worth 16,384
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes240 12
Gray code110000000011011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100000000010010
32-bit00000000000000000100000000010010
64-bit0000000000000000000000000000000000000000000000000100000000010010
One's complement1011111111101101at 16 bits, every bit flipped
Bits reversed0100100000000010at 16 bits
Rotated left by 11000000000100100at 16 bits, wrapping
Shifted left by 11000000000100100= 32,804, no wrap
Shifted right by 110000000001001= 8,201, discarding the low bit
These bits as a double8.10366472 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime16,411+9
Previous prime16,381−21
Distance to nearest prime9
Nearest square below16,384
Nearest square above16,641

Powers & multiples

16,402 to the power 2269,025,604
16,402 to the power 34,412,557,956,808
16,402 to the power 472,374,775,607,564,816
16,402 to the power 51,187,091,069,515,278,112,032
First ten multiples16,402, 32,804, 49,206, 65,608, 82,010, 98,412, 114,814, 131,216, 147,618, 164,020
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1115the total stopping time
Highest value reached41,5242× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps16,402 → 8,201 → 24,604 → 12,302 → 6,151 → 18,454 → 9,227 → 27,682 → 13,841 → 41,524 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,640,200%
16,402% as a decimal164.02
16,402% of 10016,402
16,402% of 1,000164,020
As a fraction of 10016,402/100

Read another way

As bytes16.018 KiB
As a 24-bit colour#004012

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 “16402” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.