Recognised as Number

43,113

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value43,113

Digit count5

Digit sum12

Digit product36

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 7 × 2,053

Distinct prime factors33, 7, 2,053

Number of divisors8

Sum of divisors σ(n)65,728

Aliquot sum22,615sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,052the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 24,624

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 7, 21, 2,053, 6,159, 14,371, 43,1138 in total

Arithmetic

Previous number43,112

Next number43,114

Double86,226

Half21,556.5

Square1,858,730,769

Cube80,135,459,643,897

Square root207.636701958≈irrational, shown to 9 decimal places

Cube root35.064642441≈

Negation-43,113

Reciprocal0.0000231949≈

Representations

Decimal43,113

Binary101010000110100116 bits

Octal124151

HexadecimalA869

Base 36X9L

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

In wordsforty-three thousand, one hundred and thirteen

Ordinalforty-three thousand, one hundred and thirteenth

Scientific notation4.3113 × 10^4

Engineering notation43.113 × 10^3

In other bases

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

Quinary2334423base 5; one hand: 7 digits

Septenary236460base 7: 6 digits

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

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

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

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

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

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

Bit-level

1010100001101001

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2a8 69

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

At each machine width

16-bit1010100001101001

32-bit00000000000000001010100001101001

64-bit0000000000000000000000000000000000000000000000001010100001101001

One's complement0101011110010110at 16 bits, every bit flipped

Bits reversed1001011000010101at 16 bits

Rotated left by 10101000011010011at 16 bits, wrapping

Shifted left by 110101000011010010= 86,226, no wrap

Shifted right by 1101010000110100= 21,556, discarding the low bit

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

Nearest landmarks

Next prime43,117+4

Previous prime43,103−10

Distance to nearest prime4

Nearest square below42,849

Nearest square above43,264

Powers & multiples

43,113 to the power 21,858,730,769

43,113 to the power 380,135,459,643,897

43,113 to the power 43,454,880,071,627,331,361

43,113 to the power 5148,950,244,528,069,136,966,793

First ten multiples43,113, 86,226, 129,339, 172,452, 215,565, 258,678, 301,791, 344,904, 388,017, 431,130

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 7Yes

Divisible by 8No, remainder 1

Divisible by 9No, remainder 3

Divisible by 10No, remainder 3

Divisible by 11No, remainder 4

Divisible by 12No, remainder 9

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 175the total stopping time

Highest value reached327,4007× the starting value

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

First steps43,113 → 129,340 → 64,670 → 32,335 → 97,006 → 48,503 → 145,510 → 72,755 → 218,266 → 109,133 → …

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

As a percentage & fraction

As a percentage4,311,300%

43,113% as a decimal431.13

43,113% of 10043,113

43,113% of 1,000431,130

As a fraction of 10043,113/100

Read another way

As seconds11 hours, 58 minutes and 33 seconds

As bytes42.103 KiB

As a 24-bit colour#00A869

Keep nerding

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