Nerdulator> put something in

Recognised as Number

16,405

  • Positive
  • Odd
  • Composite
  • 5 digits

16,405 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 7.

Number properties

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

Factors & divisors

Prime factorisation5 × 17 × 193
Distinct prime factors35, 17, 193
Number of divisors8
Sum of divisors σ(n)20,952
Aliquot sum4,547sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)12,288integers below n that share no factor with it
Carmichael function λ(n)192the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,288
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 17, 85, 193, 965, 3,281, 16,4058 in total

Arithmetic

Previous number16,404
Next number16,406
Double32,810
Square root128.082004981≈irrational, shown to 9 decimal places
Cube root25.409263573≈
Negation-16,405
Reciprocal0.000060957≈

Representations

Decimal16,405
Binary10000000001010115 bits
Octal40025
Hexadecimal4015
Base 36CNP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixteen thousand, four hundred and five
Ordinalsixteen thousand, four hundred and fifth
Scientific notation1.6405 × 10^4
Engineering notation16.405 × 10^3

In other bases

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

Bit-level

0100000000010101
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 odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes240 15
Gray code110000000011111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100000000010101
32-bit00000000000000000100000000010101
64-bit0000000000000000000000000000000000000000000000000100000000010101
One's complement1011111111101010at 16 bits, every bit flipped
Bits reversed1010100000000010at 16 bits
Rotated left by 11000000000101010at 16 bits, wrapping
Shifted left by 11000000000101010= 32,810, no wrap
Shifted right by 110000000001010= 8,202, discarding the low bit
These bits as a double8.10514692 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime16,411+6
Previous prime16,381−24
Distance to nearest prime6
Nearest square below16,384
Nearest square above16,641

Powers & multiples

16,405 to the power 2269,124,025
16,405 to the power 34,414,979,630,125
16,405 to the power 472,427,740,832,200,625
16,405 to the power 51,188,177,088,352,251,253,125
First ten multiples16,405, 32,810, 49,215, 65,620, 82,025, 98,430, 114,835, 131,240, 147,645, 164,050
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 140the total stopping time
Highest value reached49,2163× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps16,405 → 49,216 → 24,608 → 12,304 → 6,152 → 3,076 → 1,538 → 769 → 2,308 → 1,154 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,640,500%
16,405% as a decimal164.05
16,405% of 10016,405
16,405% of 1,000164,050
As a fraction of 10016,405/100

Read another way

As bytes16.021 KiB
As a 24-bit colour#004015

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