Number

10,371

Positive
Odd
Composite
5 digits

10,371 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value10,371

Digit count5

Digit sum12

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 3,457

Distinct prime factors23, 3,457

Number of divisors4

Sum of divisors σ(n)13,832

Aliquot sum3,461sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 3,457, 10,3714 in total

Arithmetic

Previous number10,370

Next number10,372

Double20,742

Half5,185.5

Square107,557,641

Cube1,115,480,294,811

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

Cube root21.80755006≈

Negation-10,371

Reciprocal0.0000964227≈

Representations

Decimal10,371

Binary1010001000001114 bits

Octal24203

Hexadecimal2883

Base 36803

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

In wordsten thousand, three hundred and seventy-one

Ordinalten thousand, three hundred and seventy-first

Scientific notation1.0371 × 10^4

Engineering notation10.371 × 10^3

Nearest landmarks

Next prime10,391+20

Previous prime10,369−2

Distance to nearest prime2

Nearest square below10,201

Nearest square above10,404

Powers & multiples

10,371 to the power 2107,557,641

10,371 to the power 31,115,480,294,811

10,371 to the power 411,568,646,137,484,881

10,371 to the power 5119,978,429,091,855,700,851

First ten multiples10,371, 20,742, 31,113, 41,484, 51,855, 62,226, 72,597, 82,968, 93,339, 103,710

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 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 3

Divisible by 9No, remainder 3

Divisible by 10No, remainder 1

Divisible by 11No, remainder 9

Divisible by 12No, remainder 3

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 142the total stopping time

Highest value reached46,6724× the starting value

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

First steps10,371 → 31,114 → 15,557 → 46,672 → 23,336 → 11,668 → 5,834 → 2,917 → 8,752 → 4,376 → …

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

As a percentage & fraction

As a percentage1,037,100%

10,371% as a decimal103.71

10,371% of 10010,371

10,371% of 1,000103,710

As a fraction of 10010,371/100

Read another way

As seconds2 hours, 52 minutes and 51 seconds

As bytes10.128 KiB

As a 24-bit colour#002883

Keep nerding

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