Recognised as Number

13,570

Positive
Even
Composite
5 digits

13,570 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value13,570

Digit count5

Digit sum16

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 23 × 59

Distinct prime factors42, 5, 23, 59

Number of divisors16

Sum of divisors σ(n)25,920

Aliquot sum12,350sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,276the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,104

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 23, 46, 59, 115, 118, 230, 295, 590, 1,357, 2,714, 6,785, 13,57016 in total

Arithmetic

Previous number13,569

Next number13,571

Double27,140

Half6,785

Square184,144,900

Cube2,498,846,293,000

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

Cube root23.852099694≈

Negation-13,570

Reciprocal0.000073692≈

Representations

Decimal13,570

Binary1101010000001014 bits

Octal32402

Hexadecimal3502

Base 36AGY

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

In wordsthirteen thousand, five hundred and seventy

Ordinalthirteen thousand, five hundred and seventieth

Scientific notation1.357 × 10^4

Engineering notation13.57 × 10^3

In other bases

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

Quinary413240base 5; one hand: 6 digits

Septenary54364base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011010100000010

Bit length14 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 13worth 8,192

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes235 02

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

At each machine width

16-bit0011010100000010

32-bit00000000000000000011010100000010

64-bit0000000000000000000000000000000000000000000000000011010100000010

One's complement1100101011111101at 16 bits, every bit flipped

Bits reversed0100000010101100at 16 bits

Rotated left by 10110101000000100at 16 bits, wrapping

Shifted left by 1110101000000100= 27,140, no wrap

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

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

Nearest landmarks

Next prime13,577+7

Previous prime13,567−3

Distance to nearest prime3

Nearest square below13,456

Nearest square above13,689

Powers & multiples

13,570 to the power 2184,144,900

13,570 to the power 32,498,846,293,000

13,570 to the power 433,909,344,196,010,000

13,570 to the power 5460,149,800,739,855,700,000

First ten multiples13,570, 27,140, 40,710, 54,280, 67,850, 81,420, 94,990, 108,560, 122,130, 135,700

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 4

Divisible by 8No, remainder 2

Divisible by 9No, remainder 7

Divisible by 10Yes

Divisible by 11No, remainder 7

Divisible by 12No, remainder 10

Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 189the total stopping time

Highest value reached28,9962× the starting value

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

First steps13,570 → 6,785 → 20,356 → 10,178 → 5,089 → 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,000%

13,570% as a decimal135.7

13,570% of 10013,570

13,570% of 1,000135,700

As a fraction of 10013,570/100

Read another way

As seconds3 hours, 46 minutes and 10 seconds

As bytes13.252 KiB

As a 24-bit colour#003502

Keep nerding

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