Recognised as Number
83,405
- Positive
- Odd
- Composite
- 5 digits
83,405 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value83,405
Digit count5
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 7 × 2,383
Distinct prime factors35, 7, 2,383
Number of divisors8
Sum of divisors σ(n)114,432
Aliquot sum31,027sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)57,168integers below n that share no factor with it
Carmichael function λ(n)4,764the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 57,168
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 7, 35, 2,383, 11,915, 16,681, 83,4058 in total
Arithmetic
Representations
Decimal83,405
Binary1010001011100110117 bits
Octal242715
Hexadecimal145CD
Base 361SCT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-three thousand, four hundred and five
Ordinaleighty-three thousand, four hundred and fifth
Scientific notation8.3405 × 10^4
Engineering notation83.405 × 10^3
In other bases
Ternary11020102002base 3; the most digit-efficient integer base after e: 11 digits
Quinary10132110base 5; one hand: 8 digits
Septenary465110base 7: 6 digits
Nonary136362base 9; each digit is two ternary digits: 6 digits
Duodecimal40325base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimala8a5base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal23:10:5base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111T011T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101101011011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010100010111001101
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 45 cd
Gray code11110011100101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010100010111001101
64-bit0000000000000000000000000000000000000000000000010100010111001101
One's complement11111111111111101011101000110010at 32 bits, every bit flipped
Bits reversed10110011101000101000000000000000at 32 bits
Rotated left by 100000000000000101000101110011010at 32 bits, wrapping
Shifted left by 1101000101110011010= 166,810, no wrap
Shifted right by 11010001011100110= 41,702, discarding the low bit
These bits as a double4.12075452 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
83,405 to the power 26,956,394,025
83,405 to the power 3580,198,043,655,125
83,405 to the power 448,391,417,831,055,700,625
83,405 to the power 54,036,086,204,199,200,710,628,125
First ten multiples83,405, 166,810, 250,215, 333,620, 417,025, 500,430, 583,835, 667,240, 750,645, 834,050
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 5
Collatz (3n + 1) trajectory
Steps to reach 145the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps83,405 → 250,216 → 125,108 → 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,500%
83,405% as a decimal834.05
83,405% of 10083,405
83,405% of 1,000834,050
As a fraction of 10083,405/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 83,405
Nerdulate something else
Nothing in mind? Surprise me · today’s page