Recognised as Number

13,571

Positive
Odd
Composite
5 digits

13,571 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value13,571

Digit count5

Digit sum17

Digit product105

Multiplicative persistence2times 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 factorisation41 × 331

Distinct prime factors241, 331

Number of divisors4

Sum of divisors σ(n)13,944

Aliquot sum373sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,320the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 13,200

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

SquarefreeYesno repeated prime factor

All divisors1, 41, 331, 13,5714 in total

Arithmetic

Previous number13,570

Next number13,572

Double27,142

Half6,785.5

Square184,172,041

Cube2,499,398,768,411

Square root116.49463507≈irrational, shown to 9 decimal places

Cube root23.852685582≈

Negation-13,571

Reciprocal0.0000736865≈

Representations

Decimal13,571

Binary1101010000001114 bits

Octal32403

Hexadecimal3503

Base 36AGZ

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

In wordsthirteen thousand, five hundred and seventy-one

Ordinalthirteen thousand, five hundred and seventy-first

Scientific notation1.3571 × 10^4

Engineering notation13.571 × 10^3

In other bases

Ternary200121122base 3; the most digit-efficient integer base after e: 9 digits

Quinary413241base 5; one hand: 6 digits

Septenary54365base 7: 5 digits

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

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

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

Sexagesimal3:46:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0011010100000011

Bit length14 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits8within that length

Bit parityeven6 set bits, so even; not the same as the number itself being odd

Highest set bitbit 13worth 8,192

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes235 03

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

At each machine width

16-bit0011010100000011

32-bit00000000000000000011010100000011

64-bit0000000000000000000000000000000000000000000000000011010100000011

One's complement1100101011111100at 16 bits, every bit flipped

Bits reversed1100000010101100at 16 bits

Rotated left by 10110101000000110at 16 bits, wrapping

Shifted left by 1110101000000110= 27,142, no wrap

Shifted right by 11101010000001= 6,785, discarding the low bit

These bits as a double6.70496488 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime13,577+6

Previous prime13,567−4

Distance to nearest prime4

Nearest square below13,456

Nearest square above13,689

Powers & multiples

13,571 to the power 2184,172,041

13,571 to the power 32,499,398,768,411

13,571 to the power 433,919,340,686,105,681

13,571 to the power 5460,319,372,451,140,196,851

First ten multiples13,571, 27,142, 40,713, 54,284, 67,855, 81,426, 94,997, 108,568, 122,139, 135,710

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 5

Divisible by 8No, remainder 3

Divisible by 9No, remainder 8

Divisible by 10No, remainder 1

Divisible by 11No, remainder 8

Divisible by 12No, remainder 11

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 189the total stopping time

Highest value reached61,0724× the starting value

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

First steps13,571 → 40,714 → 20,357 → 61,072 → 30,536 → 15,268 → 7,634 → 3,817 → 11,452 → 5,726 → …

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

As a percentage & fraction

As a percentage1,357,100%

13,571% as a decimal135.71

13,571% of 10013,571

13,571% of 1,000135,710

As a fraction of 10013,571/100

Read another way

As seconds3 hours, 46 minutes and 11 seconds

As bytes13.253 KiB

As a 24-bit colour#003503

Keep nerding

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