Nerdulator> put something in

Number

10,201

  • Positive
  • Odd
  • Composite
  • Perfect square
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value10,201
Digit count5
Digit sum4
Digital root4repeated digit sum
PalindromicYesreads the same backwards
Perfect squareYes, 101²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation101^2
Distinct prime factors1101
Number of divisors3
Sum of divisors σ(n)10,303
Aliquot sum102sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)10,100integers below n that share no factor with it
SquarefreeNohas a repeated prime factor
All divisors1, 101, 10,2013 in total

Arithmetic

Previous number10,200
Next number10,202
Double20,402
Square root101exact
Cube root21.687737556
Negation-10,201
Reciprocal0.0000980296

Representations

Decimal10,201
Binary1001111101100114 bits
Octal23731
Hexadecimal27D9
Base 367VD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsten thousand, two hundred and one
Ordinalten thousand, two hundred and first
Scientific notation1.0201 × 10^4
Engineering notation10.201 × 10^3

Nearest landmarks

Next prime10,211+10
Previous prime10,193−8
Distance to nearest prime8
Nearest square below10,201
Nearest square above10,404

Powers & multiples

10,201 to the power 2104,060,401
10,201 to the power 31,061,520,150,601
10,201 to the power 410,828,567,056,280,801
10,201 to the power 5110,462,212,541,120,451,001
First ten multiples10,201, 20,402, 30,603, 40,804, 51,005, 61,206, 71,407, 81,608, 91,809, 102,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 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 142the total stopping time
Highest value reached34,4323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps10,201 → 30,604 → 15,302 → 7,651 → 22,954 → 11,477 → 34,432 → 17,216 → 8,608 → 4,304 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,020,100%
10,201% as a decimal102.01
10,201% of 10010,201
10,201% of 1,000102,010
As a fraction of 10010,201/100

Read another way

As bytes9.962 KiB
As a 24-bit colour#0027D9

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “10201” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.