Recognised as Number

43,615

Positive
Odd
Composite
5 digits

43,615 is an odd 5-digit integer and a composite number. It has 16 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value43,615

Digit count5

Digit sum19

Digit product360

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 11 × 13 × 61

Distinct prime factors45, 11, 13, 61

Number of divisors16

Sum of divisors σ(n)62,496

Aliquot sum18,881sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 5, 11, 13, 55, 61, 65, 143, 305, 671, 715, 793, 3,355, 3,965, 8,723, 43,61516 in total

Arithmetic

Previous number43,614

Next number43,616

Double87,230

Half21,807.5

Square1,902,268,225

Cube82,967,428,633,375

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

Cube root35.200213067≈

Negation-43,615

Reciprocal0.0000229279≈

Representations

Decimal43,615

Binary101010100101111116 bits

Octal125137

HexadecimalAA5F

Base 36XNJ

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

In wordsforty-three thousand, six hundred and fifteen

Ordinalforty-three thousand, six hundred and fifteenth

Scientific notation4.3615 × 10^4

Engineering notation43.615 × 10^3

In other bases

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

Quinary2343430base 5; one hand: 7 digits

Septenary241105base 7: 6 digits

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

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

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

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

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

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

Bit-level

1010101001011111

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

Bit parityeven10 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

Bytes2aa 5f

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

At each machine width

16-bit1010101001011111

32-bit00000000000000001010101001011111

64-bit0000000000000000000000000000000000000000000000001010101001011111

One's complement0101010110100000at 16 bits, every bit flipped

Bits reversed1111101001010101at 16 bits

Rotated left by 10101010010111111at 16 bits, wrapping

Shifted left by 110101010010111110= 87,230, no wrap

Shifted right by 1101010100101111= 21,807, discarding the low bit

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

Nearest landmarks

Next prime43,627+12

Previous prime43,613−2

Distance to nearest prime2

Nearest square below43,264

Nearest square above43,681

Powers & multiples

43,615 to the power 21,902,268,225

43,615 to the power 382,967,428,633,375

43,615 to the power 43,618,624,399,844,650,625

43,615 to the power 5157,826,303,199,224,437,009,375

First ten multiples43,615, 87,230, 130,845, 174,460, 218,075, 261,690, 305,305, 348,920, 392,535, 436,150

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9No, remainder 1

Divisible by 10No, remainder 5

Divisible by 11Yes

Divisible by 12No, remainder 7

Divisible by 100No, remainder 15

Collatz (3n + 1) trajectory

Steps to reach 1163the total stopping time

Highest value reached662,41615× the starting value

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

First steps43,615 → 130,846 → 65,423 → 196,270 → 98,135 → 294,406 → 147,203 → 441,610 → 220,805 → 662,416 → …

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

As a percentage & fraction

As a percentage4,361,500%

43,615% as a decimal436.15

43,615% of 10043,615

43,615% of 1,000436,150

As a fraction of 10043,615/100

Read another way

As seconds12 hours, 6 minutes and 55 seconds

As bytes42.593 KiB

As a 24-bit colour#00AA5F

Keep nerding

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