Nerdulator> put something in

Number

59,704

  • Positive
  • Even
  • Composite
  • 5 digits

59,704 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value59,704
Digit count5
Digit sum25
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 17 × 439
Distinct prime factors32, 17, 439
Number of divisors16
Sum of divisors σ(n)118,800
Aliquot sum59,096sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)28,032integers below n that share no factor with it
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 17, 34, 68, 136, 439, 878, 1,756, 3,512, 7,463, 14,926, 29,852, 59,70416 in total

Arithmetic

Previous number59,703
Next number59,705
Double119,408
Half29,852
Square root244.344019775irrational, shown to 9 decimal places
Cube root39.084192431
Negation-59,704
Reciprocal0.0000167493

Representations

Decimal59,704
Binary111010010011100016 bits
Octal164470
HexadecimalE938
Base 361A2G
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-nine thousand, seven hundred and four
Ordinalfifty-nine thousand, seven hundred and fourth
Scientific notation5.9704 × 10^4
Engineering notation59.704 × 10^3

Nearest landmarks

Next prime59,707+3
Previous prime59,699−5
Distance to nearest prime3
Nearest square below59,536
Nearest square above60,025

Powers & multiples

59,704 to the power 23,564,567,616
59,704 to the power 3212,818,944,945,664
59,704 to the power 412,706,142,289,035,923,456
59,704 to the power 5758,607,519,224,600,774,017,024
First ten multiples59,704, 119,408, 179,112, 238,816, 298,520, 358,224, 417,928, 477,632, 537,336, 597,040
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 4
Divisible by 11No, remainder 7
Divisible by 12No, remainder 4
Divisible by 100No, remainder 4

Collatz (3n + 1) trajectory

Steps to reach 173the total stopping time
Highest value reached59,704
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps59,704 → 29,852 → 14,926 → 7,463 → 22,390 → 11,195 → 33,586 → 16,793 → 50,380 → 25,190 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,970,400%
59,704% as a decimal597.04
59,704% of 10059,704
59,704% of 1,000597,040
As a fraction of 10059,704/100

Read another way

As bytes58.305 KiB
As a 24-bit colour#00E938

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