Recognised as Number

43,353

Positive
Odd
Composite
5 digits

43,353 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value43,353

Digit count5

Digit sum18

Digit product540

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 4,817

Distinct prime factors23, 4,817

Number of divisors6

Sum of divisors σ(n)62,634

Aliquot sum19,281sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)14,448the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 28,896

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 4,817, 14,451, 43,3536 in total

Arithmetic

Previous number43,352

Next number43,354

Double86,706

Half21,676.5

Square1,879,482,609

Cube81,481,209,547,977

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

Cube root35.129587636≈

Negation-43,353

Reciprocal0.0000230665≈

Representations

Decimal43,353

Binary101010010101100116 bits

Octal124531

HexadecimalA959

Base 36XG9

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

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

Ordinalforty-three thousand, three hundred and fifty-third

Scientific notation4.3353 × 10^4

Engineering notation43.353 × 10^3

In other bases

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

Quinary2341403base 5; one hand: 7 digits

Septenary240252base 7: 6 digits

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

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

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

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

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

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

Bit-level

1010100101011001

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2a9 59

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

At each machine width

16-bit1010100101011001

32-bit00000000000000001010100101011001

64-bit0000000000000000000000000000000000000000000000001010100101011001

One's complement0101011010100110at 16 bits, every bit flipped

Bits reversed1001101010010101at 16 bits

Rotated left by 10101001010110011at 16 bits, wrapping

Shifted left by 110101001010110010= 86,706, no wrap

Shifted right by 1101010010101100= 21,676, discarding the low bit

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

Nearest landmarks

Next prime43,391+38

Previous prime43,331−22

Distance to nearest prime22

Nearest square below43,264

Nearest square above43,681

Powers & multiples

43,353 to the power 21,879,482,609

43,353 to the power 381,481,209,547,977

43,353 to the power 43,532,454,877,533,446,881

43,353 to the power 5153,142,516,305,707,522,631,993

First ten multiples43,353, 86,706, 130,059, 173,412, 216,765, 260,118, 303,471, 346,824, 390,177, 433,530

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 3

Divisible by 11No, remainder 2

Divisible by 12No, remainder 9

Divisible by 100No, remainder 53

Collatz (3n + 1) trajectory

Steps to reach 175the total stopping time

Highest value reached146,3203× the starting value

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

First steps43,353 → 130,060 → 65,030 → 32,515 → 97,546 → 48,773 → 146,320 → 73,160 → 36,580 → 18,290 → …

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

As a percentage & fraction

As a percentage4,335,300%

43,353% as a decimal433.53

43,353% of 10043,353

43,353% of 1,000433,530

As a fraction of 10043,353/100

Read another way

As seconds12 hours, 2 minutes and 33 seconds

As bytes42.337 KiB

As a 24-bit colour#00A959

Keep nerding

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