Number

10,501

Positive
Odd
Prime
5 digits

10,501 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value10,501

Digit count5

Digit sum7

Digital root7repeated digit sum

PalindromicYesreads the same backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation10,501

Distinct prime factors110,501

Number of divisors2

Sum of divisors σ(n)10,502

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

SquarefreeYesno repeated prime factor

All divisors1, 10,5012 in total

Arithmetic

Previous number10,500

Next number10,502

Double21,002

Half5,250.5

Square110,271,001

Cube1,157,955,781,501

Square root102.474387044≈irrational, shown to 9 decimal places

Cube root21.898290839≈

Negation-10,501

Reciprocal0.000095229≈

Representations

Decimal10,501

Binary1010010000010114 bits

Octal24405

Hexadecimal2905

Base 3683P

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

In wordsten thousand, five hundred and one

Ordinalten thousand, five hundred and first

Scientific notation1.0501 × 10^4

Engineering notation10.501 × 10^3

Nearest landmarks

Next prime10,513+12

Previous prime10,499−2

Distance to nearest prime0, it is prime

Nearest square below10,404

Nearest square above10,609

Powers & multiples

10,501 to the power 2110,271,001

10,501 to the power 31,157,955,781,501

10,501 to the power 412,159,693,661,542,001

10,501 to the power 5127,688,943,139,852,552,501

First ten multiples10,501, 21,002, 31,503, 42,004, 52,505, 63,006, 73,507, 84,008, 94,509, 105,010

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 7

Divisible by 10No, remainder 1

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 129the total stopping time

Highest value reached31,5043× the starting value

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

First steps10,501 → 31,504 → 15,752 → 7,876 → 3,938 → 1,969 → 5,908 → 2,954 → 1,477 → 4,432 → …

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

As a percentage & fraction

As a percentage1,050,100%

10,501% as a decimal105.01

10,501% of 10010,501

10,501% of 1,000105,010

As a fraction of 10010,501/100

Read another way

As seconds2 hours, 55 minutes and 1 second

As bytes10.255 KiB

As a 24-bit colour#002905

Keep nerding

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