Nerdulator> put something in

Recognised as Number

83,404

  • Positive
  • Even
  • Composite
  • 5 digits

83,404 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 1.

Number properties

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

Factors & divisors

Prime factorisation2^2 × 29 × 719
Distinct prime factors32, 29, 719
Number of divisors12
Sum of divisors σ(n)151,200
Aliquot sum67,796sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)40,208integers below n that share no factor with it
Carmichael function λ(n)10,052the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 40,208
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 29, 58, 116, 719, 1,438, 2,876, 20,851, 41,702, 83,40412 in total

Arithmetic

Previous number83,403
Next number83,405
Double166,808
Half41,702
Square root288.797506914≈irrational, shown to 9 decimal places
Cube root43.691366352≈
Negation-83,404
Reciprocal0.0000119898≈

Representations

Decimal83,404
Binary1010001011100110017 bits
Octal242714
Hexadecimal145CC
Base 361SCS
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-three thousand, four hundred and four
Ordinaleighty-three thousand, four hundred and fourth
Scientific notation8.3404 × 10^4
Engineering notation83.404 × 10^3

In other bases

Ternary11020102001base 3; the most digit-efficient integer base after e: 11 digits
Quinary10132104base 5; one hand: 8 digits
Septenary465106base 7: 6 digits
Nonary136361base 9; each digit is two ternary digits: 6 digits
Duodecimal40324base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimala8a4base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal23:10:4base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111T011T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101101011011100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010100010111001100
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes301 45 cc
Gray code11110011100101010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010100010111001100
64-bit0000000000000000000000000000000000000000000000010100010111001100
One's complement11111111111111101011101000110011at 32 bits, every bit flipped
Bits reversed00110011101000101000000000000000at 32 bits
Rotated left by 100000000000000101000101110011000at 32 bits, wrapping
Shifted left by 1101000101110011000= 166,808, no wrap
Shifted right by 11010001011100110= 41,702, discarding the low bit
These bits as a double4.12070511 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime83,407+3
Previous prime83,401−3
Distance to nearest prime3
Nearest square below82,944
Nearest square above83,521

Powers & multiples

83,404 to the power 26,956,227,216
83,404 to the power 3580,177,174,723,264
83,404 to the power 448,389,097,080,619,110,656
83,404 to the power 54,035,844,252,911,956,305,153,024
First ten multiples83,404, 166,808, 250,212, 333,616, 417,020, 500,424, 583,828, 667,232, 750,636, 834,040
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 145the total stopping time
Highest value reached93,8321× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps83,404 → 41,702 → 20,851 → 62,554 → 31,277 → 93,832 → 46,916 → 23,458 → 11,729 → 35,188 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage8,340,400%
83,404% as a decimal834.04
83,404% of 10083,404
83,404% of 1,000834,040
As a fraction of 10083,404/100

Read another way

As bytes81.449 KiB
As a 24-bit colour#0145CC

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