Nerdulator> put something in

Recognised as Number

16,401

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value16,401
Digit count5
Digit sum12
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation3 × 7 × 11 × 71
Distinct prime factors43, 7, 11, 71
Number of divisors16
Sum of divisors σ(n)27,648
Aliquot sum11,247sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,400integers below n that share no factor with it
Carmichael function λ(n)210the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,400
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 11, 21, 33, 71, 77, 213, 231, 497, 781, 1,491, 2,343, 5,467, 16,40116 in total

Arithmetic

Previous number16,400
Next number16,402
Double32,802
Square root128.066389033≈irrational, shown to 9 decimal places
Cube root25.407198241≈
Negation-16,401
Reciprocal0.0000609719≈

Representations

Decimal16,401
Binary10000000001000115 bits
Octal40021
Hexadecimal4011
Base 36CNL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixteen thousand, four hundred and one
Ordinalsixteen thousand, four hundred and first
Scientific notation1.6401 × 10^4
Engineering notation16.401 × 10^3

In other bases

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

Bit-level

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

At each machine width

16-bit0100000000010001
32-bit00000000000000000100000000010001
64-bit0000000000000000000000000000000000000000000000000100000000010001
One's complement1011111111101110at 16 bits, every bit flipped
Bits reversed1000100000000010at 16 bits
Rotated left by 11000000000100010at 16 bits, wrapping
Shifted left by 11000000000100010= 32,802, no wrap
Shifted right by 110000000001000= 8,200, discarding the low bit
These bits as a double8.10317066 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime16,411+10
Previous prime16,381−20
Distance to nearest prime10
Nearest square below16,384
Nearest square above16,641

Powers & multiples

16,401 to the power 2268,992,801
16,401 to the power 34,411,750,929,201
16,401 to the power 472,357,126,989,825,601
16,401 to the power 51,186,729,239,760,129,682,001
First ten multiples16,401, 32,802, 49,203, 65,604, 82,005, 98,406, 114,807, 131,208, 147,609, 164,010
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1159the total stopping time
Highest value reached49,2043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps16,401 → 49,204 → 24,602 → 12,301 → 36,904 → 18,452 → 9,226 → 4,613 → 13,840 → 6,920 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,640,100%
16,401% as a decimal164.01
16,401% of 10016,401
16,401% of 1,000164,010
As a fraction of 10016,401/100

Read another way

As bytes16.017 KiB
As a 24-bit colour#004011

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