Nerdulator> put something in

Number

39,601

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

39,601 is an odd 5-digit integer and a composite number. It has 3 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value39,601
Digit count5
Digit sum19
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 199²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation199^2
Distinct prime factors1199
Number of divisors3
Sum of divisors σ(n)39,801
Aliquot sum200sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)39,402integers below n that share no factor with it
SquarefreeNohas a repeated prime factor
All divisors1, 199, 39,6013 in total

Arithmetic

Previous number39,600
Next number39,602
Double79,202
Square root199exact
Cube root34.085425327
Negation-39,601
Reciprocal0.0000252519

Representations

Decimal39,601
Binary100110101011000116 bits
Octal115261
Hexadecimal9AB1
Base 36UK1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-nine thousand, six hundred and one
Ordinalthirty-nine thousand, six hundred and first
Scientific notation3.9601 × 10^4
Engineering notation39.601 × 10^3

Nearest landmarks

Next prime39,607+6
Previous prime39,581−20
Distance to nearest prime6
Nearest square below39,601
Nearest square above40,000

Powers & multiples

39,601 to the power 21,568,239,201
39,601 to the power 362,103,840,598,801
39,601 to the power 42,459,374,191,553,118,401
39,601 to the power 597,393,677,359,695,041,798,001
First ten multiples39,601, 79,202, 118,803, 158,404, 198,005, 237,606, 277,207, 316,808, 356,409, 396,010
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

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 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time
Highest value reached118,8043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps39,601 → 118,804 → 59,402 → 29,701 → 89,104 → 44,552 → 22,276 → 11,138 → 5,569 → 16,708 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,960,100%
39,601% as a decimal396.01
39,601% of 10039,601
39,601% of 1,000396,010
As a fraction of 10039,601/100

Read another way

As bytes38.673 KiB
As a 24-bit colour#009AB1

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 “39601” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.