Recognised as Number

43,613

Positive
Odd
Prime
5 digits

43,613 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value43,613

Digit count5

Digit sum17

Digit product216

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 factorisation43,613

Distinct prime factors143,613

Number of divisors2

Sum of divisors σ(n)43,614

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)43,612the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 43,6132 in total

Arithmetic

Previous number43,612

Next number43,614

Double87,226

Half21,806.5

Square1,902,093,769

Cube82,956,015,547,397

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

Cube root35.199675014≈

Negation-43,613

Reciprocal0.0000229289≈

Representations

Decimal43,613

Binary101010100101110116 bits

Octal125135

HexadecimalAA5D

Base 36XNH

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

In wordsforty-three thousand, six hundred and thirteen

Ordinalforty-three thousand, six hundred and thirteenth

Scientific notation4.3613 × 10^4

Engineering notation43.613 × 10^3

In other bases

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

Quinary2343423base 5; one hand: 7 digits

Septenary241103base 7: 6 digits

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

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

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

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

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

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

Bit-level

1010101001011101

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

Bytes2aa 5d

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

At each machine width

16-bit1010101001011101

32-bit00000000000000001010101001011101

64-bit0000000000000000000000000000000000000000000000001010101001011101

One's complement0101010110100010at 16 bits, every bit flipped

Bits reversed1011101001010101at 16 bits

Rotated left by 10101010010111011at 16 bits, wrapping

Shifted left by 110101010010111010= 87,226, no wrap

Shifted right by 1101010100101110= 21,806, discarding the low bit

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

Nearest landmarks

Next prime43,627+14

Previous prime43,609−4

Distance to nearest prime0, it is prime

Nearest square below43,264

Nearest square above43,681

Powers & multiples

43,613 to the power 21,902,093,769

43,613 to the power 382,956,015,547,397

43,613 to the power 43,617,960,706,068,625,361

43,613 to the power 5157,790,120,273,770,957,869,293

First ten multiples43,613, 87,226, 130,839, 174,452, 218,065, 261,678, 305,291, 348,904, 392,517, 436,130

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 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 9

Divisible by 12No, remainder 5

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 157the total stopping time

Highest value reached130,8403× the starting value

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

First steps43,613 → 130,840 → 65,420 → 32,710 → 16,355 → 49,066 → 24,533 → 73,600 → 36,800 → 18,400 → …

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

As a percentage & fraction

As a percentage4,361,300%

43,613% as a decimal436.13

43,613% of 10043,613

43,613% of 1,000436,130

As a fraction of 10043,613/100

Read another way

As seconds12 hours, 6 minutes and 53 seconds

As bytes42.591 KiB

As a 24-bit colour#00AA5D

Keep nerding

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