Nerdulator> put something in

Recognised as Number

43,366

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value43,366
Digit count5
Digit sum22
Digit product1,296
Multiplicative persistence3times 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 factorisation2 × 21,683
Distinct prime factors22, 21,683
Number of divisors4
Sum of divisors σ(n)65,052
Aliquot sum21,686sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)21,682integers below n that share no factor with it
Carmichael function λ(n)21,682the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 21,683, 43,3664 in total

Arithmetic

Previous number43,365
Next number43,367
Double86,732
Half21,683
Square root208.24504796≈irrational, shown to 9 decimal places
Cube root35.133098651≈
Negation-43,366
Reciprocal0.0000230595≈

Representations

Decimal43,366
Binary101010010110011016 bits
Octal124546
HexadecimalA966
Base 36XGM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-three thousand, three hundred and sixty-six
Ordinalforty-three thousand, three hundred and sixty-sixth
Scientific notation4.3366 × 10^4
Engineering notation43.366 × 10^3

In other bases

Ternary2012111011base 3; the most digit-efficient integer base after e: 10 digits
Quinary2341431base 5; one hand: 7 digits
Septenary240301base 7: 6 digits
Nonary65434base 9; each digit is two ternary digits: 5 digits
Duodecimal2111abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal5886base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal12:2:46base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T1TT111011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111111010111010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1010100101100110
Bit length16 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits8within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes2a9 66
Gray code1111110111010101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010100101100110
32-bit00000000000000001010100101100110
64-bit0000000000000000000000000000000000000000000000001010100101100110
One's complement0101011010011001at 16 bits, every bit flipped
Bits reversed0110011010010101at 16 bits
Rotated left by 10101001011001101at 16 bits, wrapping
Shifted left by 110101001011001100= 86,732, no wrap
Shifted right by 1101010010110011= 21,683, discarding the low bit
These bits as a double2.14256508 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime43,391+25
Previous prime43,331−35
Distance to nearest prime25
Nearest square below43,264
Nearest square above43,681

Powers & multiples

43,366 to the power 21,880,609,956
43,366 to the power 381,554,531,351,896
43,366 to the power 43,536,693,806,606,321,936
43,366 to the power 5153,372,263,617,289,757,076,576
First ten multiples43,366, 86,732, 130,098, 173,464, 216,830, 260,196, 303,562, 346,928, 390,294, 433,660
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1132the total stopping time
Highest value reached250,5045× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps43,366 → 21,683 → 65,050 → 32,525 → 97,576 → 48,788 → 24,394 → 12,197 → 36,592 → 18,296 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,336,600%
43,366% as a decimal433.66
43,366% of 10043,366
43,366% of 1,000433,660
As a fraction of 10043,366/100

Read another way

As bytes42.35 KiB
As a 24-bit colour#00A966

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