Recognised as Number

10,209

Positive
Odd
Composite
5 digits

10,209 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 value10,209

Digit count5

Digit sum12

Digit product0zero, because one of the digits is zero

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 41 × 83

Distinct prime factors33, 41, 83

Number of divisors8

Sum of divisors σ(n)14,112

Aliquot sum3,903sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,640the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,560

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 41, 83, 123, 249, 3,403, 10,2098 in total

Arithmetic

Previous number10,208

Next number10,210

Double20,418

Half5,104.5

Square104,223,681

Cube1,064,019,559,329

Square root101.039596199≈irrational, shown to 9 decimal places

Cube root21.693405515≈

Negation-10,209

Reciprocal0.0000979528≈

Representations

Decimal10,209

Binary1001111110000114 bits

Octal23741

Hexadecimal27E1

Base 367VL

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

In wordsten thousand, two hundred and nine

Ordinalten thousand, two hundred and ninth

Scientific notation1.0209 × 10^4

Engineering notation10.209 × 10^3

In other bases

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

Quinary311314base 5; one hand: 6 digits

Septenary41523base 7: 5 digits

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

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

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

Sexagesimal2:50:9base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0010011111100001

Bit length14 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits6within that length

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

Bytes227 e1

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

At each machine width

16-bit0010011111100001

32-bit00000000000000000010011111100001

64-bit0000000000000000000000000000000000000000000000000010011111100001

One's complement1101100000011110at 16 bits, every bit flipped

Bits reversed1000011111100100at 16 bits

Rotated left by 10100111111000010at 16 bits, wrapping

Shifted left by 1100111111000010= 20,418, no wrap

Shifted right by 11001111110000= 5,104, discarding the low bit

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

Nearest landmarks

Next prime10,211+2

Previous prime10,193−16

Distance to nearest prime2

Nearest square below10,201

Nearest square above10,404

Powers & multiples

10,209 to the power 2104,223,681

10,209 to the power 31,064,019,559,329

10,209 to the power 410,862,575,681,189,761

10,209 to the power 5110,896,035,129,266,270,049

First ten multiples10,209, 20,418, 30,627, 40,836, 51,045, 61,254, 71,463, 81,672, 91,881, 102,090

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 3

Divisible by 10No, remainder 9

Divisible by 11No, remainder 1

Divisible by 12No, remainder 9

Divisible by 100No, remainder 9

Collatz (3n + 1) trajectory

Steps to reach 186the total stopping time

Highest value reached65,4286× the starting value

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

First steps10,209 → 30,628 → 15,314 → 7,657 → 22,972 → 11,486 → 5,743 → 17,230 → 8,615 → 25,846 → …

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

As a percentage & fraction

As a percentage1,020,900%

10,209% as a decimal102.09

10,209% of 10010,209

10,209% of 1,000102,090

As a fraction of 10010,209/100

Read another way

As seconds2 hours, 50 minutes and 9 seconds

As bytes9.97 KiB

As a 24-bit colour#0027E1

Keep nerding

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