Nerdulator> put something in

Recognised as Number

43,362

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value43,362
Digit count5
Digit sum18
Digit product432
Multiplicative persistence3times 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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3^3 × 11 × 73
Distinct prime factors42, 3, 11, 73
Number of divisors32
Sum of divisors σ(n)106,560
Aliquot sum63,198sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)12,960integers below n that share no factor with it
Carmichael function λ(n)360the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,960
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 11, 18, 22, 27, 33, 54, 66, 73, 99, 146, 198, 219, 297, 438, 594, 657, 803, 1,314, 1,606, 1,971, 2,409, 3,942, 4,818, 7,227, 14,454, 21,681, 43,36232 in total

Arithmetic

Previous number43,361
Next number43,363
Double86,724
Half21,681
Square root208.235443669≈irrational, shown to 9 decimal places
Cube root35.132018413≈
Negation-43,362
Reciprocal0.0000230617≈

Representations

Decimal43,362
Binary101010010110001016 bits
Octal124542
HexadecimalA962
Base 36XGI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-three thousand, three hundred and sixty-two
Ordinalforty-three thousand, three hundred and sixty-second
Scientific notation4.3362 × 10^4
Engineering notation43.362 × 10^3

In other bases

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

Bit-level

1010100101100010
Bit length16 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits9within that length
Bit parityodd7 set bits, so odd; 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 62
Gray code1111110111010011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010100101100010
32-bit00000000000000001010100101100010
64-bit0000000000000000000000000000000000000000000000001010100101100010
One's complement0101011010011101at 16 bits, every bit flipped
Bits reversed0100011010010101at 16 bits
Rotated left by 10101001011000101at 16 bits, wrapping
Shifted left by 110101001011000100= 86,724, no wrap
Shifted right by 1101010010110001= 21,681, discarding the low bit
These bits as a double2.14236745 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime43,391+29
Previous prime43,331−31
Distance to nearest prime29
Nearest square below43,264
Nearest square above43,681

Powers & multiples

43,362 to the power 21,880,263,044
43,362 to the power 381,531,966,113,928
43,362 to the power 43,535,389,114,632,145,936
43,362 to the power 5153,301,542,788,679,112,076,832
First ten multiples43,362, 86,724, 130,086, 173,448, 216,810, 260,172, 303,534, 346,896, 390,258, 433,620
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

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,362 → 21,681 → 65,044 → 32,522 → 16,261 → 48,784 → 24,392 → 12,196 → 6,098 → 3,049 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,336,200%
43,362% as a decimal433.62
43,362% of 10043,362
43,362% of 1,000433,620
As a fraction of 10043,362/100

Read another way

As bytes42.346 KiB
As a 24-bit colour#00A962

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