Nerdulator> put something in

Recognised as Number

67,243

  • Positive
  • Odd
  • Composite
  • 5 digits

67,243 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value67,243
Digit count5
Digit sum22
Digit product1,008
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11 × 6,113
Distinct prime factors211, 6,113
Number of divisors4
Sum of divisors σ(n)73,368
Aliquot sum6,125sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)61,120integers below n that share no factor with it
Carmichael function λ(n)30,560the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 61,120
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 6,113, 67,2434 in total

Arithmetic

Previous number67,242
Next number67,244
Double134,486
Square root259.312552724≈irrational, shown to 9 decimal places
Cube root40.664524059≈
Negation-67,243
Reciprocal0.0000148714≈

Representations

Decimal67,243
Binary1000001101010101117 bits
Octal203253
Hexadecimal106AB
Base 361FVV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-seven thousand, two hundred and forty-three
Ordinalsixty-seven thousand, two hundred and forty-third
Scientific notation6.7243 × 10^4
Engineering notation67.243 × 10^3

In other bases

Ternary10102020111base 3; the most digit-efficient integer base after e: 11 digits
Quinary4122433base 5; one hand: 7 digits
Septenary400021base 7: 6 digits
Nonary112214base 9; each digit is two ternary digits: 6 digits
Duodecimal32ab7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal8823base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:40:43base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1011T1T0111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001101111111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010000011010101011
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 odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 06 ab
Gray code11000010111111110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010000011010101011
64-bit0000000000000000000000000000000000000000000000010000011010101011
One's complement11111111111111101111100101010100at 32 bits, every bit flipped
Bits reversed11010101011000001000000000000000at 32 bits
Rotated left by 100000000000000100000110101010110at 32 bits, wrapping
Shifted left by 1100000110101010110= 134,486, no wrap
Shifted right by 11000001101010101= 33,621, discarding the low bit
These bits as a double3.32224562 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime67,247+4
Previous prime67,231−12
Distance to nearest prime4
Nearest square below67,081
Nearest square above67,600

Powers & multiples

67,243 to the power 24,521,621,049
67,243 to the power 3304,047,364,197,907
67,243 to the power 420,445,056,910,759,860,401
67,243 to the power 51,374,786,961,850,225,292,944,443
First ten multiples67,243, 134,486, 201,729, 268,972, 336,215, 403,458, 470,701, 537,944, 605,187, 672,430
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1112the total stopping time
Highest value reached302,5964× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps67,243 → 201,730 → 100,865 → 302,596 → 151,298 → 75,649 → 226,948 → 113,474 → 56,737 → 170,212 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,724,300%
67,243% as a decimal672.43
67,243% of 10067,243
67,243% of 1,000672,430
As a fraction of 10067,243/100

Read another way

As bytes65.667 KiB
As a 24-bit colour#0106AB

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