Recognised as Number

10,210

Positive
Even
Composite
5 digits

10,210 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value10,210

Digit count5

Digit sum4

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 1,021

Distinct prime factors32, 5, 1,021

Number of divisors8

Sum of divisors σ(n)18,396

Aliquot sum8,186sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,020the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,080

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 1,021, 2,042, 5,105, 10,2108 in total

Arithmetic

Previous number10,209

Next number10,211

Double20,420

Half5,105

Square104,244,100

Cube1,064,332,261,000

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

Cube root21.694113802≈

Negation-10,210

Reciprocal0.0000979432≈

Representations

Decimal10,210

Binary1001111110001014 bits

Octal23742

Hexadecimal27E2

Base 367VM

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

In wordsten thousand, two hundred and ten

Ordinalten thousand, two hundred and tenth

Scientific notation1.021 × 10^4

Engineering notation10.21 × 10^3

In other bases

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

Quinary311320base 5; one hand: 6 digits

Septenary41524base 7: 5 digits

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

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

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

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

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

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

Bit-level

0010011111100010

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 even

Highest set bitbit 13worth 8,192

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes227 e2

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

At each machine width

16-bit0010011111100010

32-bit00000000000000000010011111100010

64-bit0000000000000000000000000000000000000000000000000010011111100010

One's complement1101100000011101at 16 bits, every bit flipped

Bits reversed0100011111100100at 16 bits

Rotated left by 10100111111000100at 16 bits, wrapping

Shifted left by 1100111111000100= 20,420, no wrap

Shifted right by 11001111110001= 5,105, discarding the low bit

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

Nearest landmarks

Next prime10,211+1

Previous prime10,193−17

Distance to nearest prime1

Nearest square below10,201

Nearest square above10,404

Powers & multiples

10,210 to the power 2104,244,100

10,210 to the power 31,064,332,261,000

10,210 to the power 410,866,832,384,810,000

10,210 to the power 5110,950,358,648,910,100,000

First ten multiples10,210, 20,420, 30,630, 40,840, 51,050, 61,260, 71,470, 81,680, 91,890, 102,100

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 4

Divisible by 10Yes

Divisible by 11No, remainder 2

Divisible by 12No, remainder 10

Divisible by 100No, remainder 10

Collatz (3n + 1) trajectory

Steps to reach 160the total stopping time

Highest value reached15,3161× the starting value

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

First steps10,210 → 5,105 → 15,316 → 7,658 → 3,829 → 11,488 → 5,744 → 2,872 → 1,436 → 718 → …

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

As a percentage & fraction

As a percentage1,021,000%

10,210% as a decimal102.1

10,210% of 10010,210

10,210% of 1,000102,100

As a fraction of 10010,210/100

Read another way

As seconds2 hours, 50 minutes and 10 seconds

As bytes9.971 KiB

As a 24-bit colour#0027E2

Keep nerding

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