Recognised as Number
83,403
- Positive
- Odd
- Composite
- 5 digits
83,403 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value83,403
Digit count5
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^3 × 3,089
Distinct prime factors23, 3,089
Number of divisors8
Sum of divisors σ(n)123,600
Aliquot sum40,197sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)55,584integers below n that share no factor with it
Carmichael function λ(n)27,792the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 55,584
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 3,089, 9,267, 27,801, 83,4038 in total
Arithmetic
Representations
Decimal83,403
Binary1010001011100101117 bits
Octal242713
Hexadecimal145CB
Base 361SCR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-three thousand, four hundred and three
Ordinaleighty-three thousand, four hundred and third
Scientific notation8.3403 × 10^4
Engineering notation83.403 × 10^3
In other bases
Ternary11020102000base 3; the most digit-efficient integer base after e: 11 digits
Quinary10132103base 5; one hand: 8 digits
Septenary465105base 7: 6 digits
Nonary136360base 9; each digit is two ternary digits: 6 digits
Duodecimal40323base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimala8a3base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal23:10:3base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111T011T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101101011011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010100010111001011
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 cb
Gray code11110011100101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010100010111001011
64-bit0000000000000000000000000000000000000000000000010100010111001011
One's complement11111111111111101011101000110100at 32 bits, every bit flipped
Bits reversed11010011101000101000000000000000at 32 bits
Rotated left by 100000000000000101000101110010110at 32 bits, wrapping
Shifted left by 1101000101110010110= 166,806, no wrap
Shifted right by 11010001011100101= 41,701, discarding the low bit
These bits as a double4.12065571 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
83,403 to the power 26,956,060,409
83,403 to the power 3580,156,306,291,827
83,403 to the power 448,386,776,413,657,247,281
83,403 to the power 54,035,602,313,228,255,394,977,243
First ten multiples83,403, 166,806, 250,209, 333,612, 417,015, 500,418, 583,821, 667,224, 750,627, 834,030
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 3
Divisible by 100No, remainder 3
Collatz (3n + 1) trajectory
Steps to reach 1257the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps83,403 → 250,210 → 125,105 → 375,316 → 187,658 → 93,829 → 281,488 → 140,744 → 70,372 → 35,186 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,340,300%
83,403% as a decimal834.03
83,403% of 10083,403
83,403% of 1,000834,030
As a fraction of 10083,403/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,403
Nerdulate something else
Nothing in mind? Surprise me · today’s page