Recognised as Number

43,343

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value43,343

Digit count5

Digit sum17

Digit product432

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation89 × 487

Distinct prime factors289, 487

Number of divisors4

Sum of divisors σ(n)43,920

Aliquot sum577sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)42,768integers below n that share no factor with it

Carmichael function λ(n)21,384the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 42,768

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 89, 487, 43,3434 in total

Arithmetic

Previous number43,342

Next number43,344

Double86,686

Half21,671.5

Square1,878,615,649

Cube81,424,838,074,607

Square root208.189817234≈irrational, shown to 9 decimal places

Cube root35.126886379≈

Negation-43,343

Reciprocal0.0000230718≈

Representations

Decimal43,343

Binary101010010100111116 bits

Octal124517

HexadecimalA94F

Base 36XFZ

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsforty-three thousand, three hundred and forty-three

Ordinalforty-three thousand, three hundred and forty-third

Scientific notation4.3343 × 10^4

Engineering notation43.343 × 10^3

In other bases

Ternary2012110022base 3; the most digit-efficient integer base after e: 10 digits

Quinary2341333base 5; one hand: 7 digits

Septenary240236base 7: 6 digits

Nonary65408base 9; each digit is two ternary digits: 5 digits

Duodecimal210bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal5873base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal12:2:23base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1T1TT11010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11111100101010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1010100101001111

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2a9 4f

Gray code1111110111101000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010100101001111

32-bit00000000000000001010100101001111

64-bit0000000000000000000000000000000000000000000000001010100101001111

One's complement0101011010110000at 16 bits, every bit flipped

Bits reversed1111001010010101at 16 bits

Rotated left by 10101001010011111at 16 bits, wrapping

Shifted left by 110101001010011110= 86,686, no wrap

Shifted right by 1101010010100111= 21,671, discarding the low bit

These bits as a double2.14142873 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime43,391+48

Previous prime43,331−12

Distance to nearest prime12

Nearest square below43,264

Nearest square above43,681

Powers & multiples

43,343 to the power 21,878,615,649

43,343 to the power 381,424,838,074,607

43,343 to the power 43,529,196,756,667,691,201

43,343 to the power 5152,965,975,024,247,739,724,943

First ten multiples43,343, 86,686, 130,029, 173,372, 216,715, 260,058, 303,401, 346,744, 390,087, 433,430

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 7

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 3

Divisible by 12No, remainder 11

Divisible by 100No, remainder 43

Collatz (3n + 1) trajectory

Steps to reach 1155the total stopping time

Highest value reached438,85610× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps43,343 → 130,030 → 65,015 → 195,046 → 97,523 → 292,570 → 146,285 → 438,856 → 219,428 → 109,714 → …

Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,334,300%

43,343% as a decimal433.43

43,343% of 10043,343

43,343% of 1,000433,430

As a fraction of 10043,343/100

Read another way

As seconds12 hours, 2 minutes and 23 seconds

As bytes42.327 KiB

As a 24-bit colour#00A94F

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.