WordGPT

The number 59951

59951 is the 6053rd prime number. Its only divisors are 1 and 59951.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 59951: the 6053rd prime number.

  2. 2

    59951 is prime, so its only factors are 1 and 59951. It is the 6053rd prime; the next prime is 59957 and the one before is 59929.

  3. 3

    The divisors add up to 59952; without 59951 itself that is 1, so 59951 is deficient (1 is less than 59951). Euler's totient φ(59951) = 59950 numbers up to 59951 share no factor with it.

  4. 4

    The digits of 59951 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.

59951 at a glance

PropertyValue
Typeprime
Number of divisors2
Sum of divisors59952
Euler totient φ(n)59950
Square3594122401
Cube215471232062351
Square root244.848933
Digit sum / digital root29 / 2
Collatz steps to 165
Scientific notation5.9951 × 10410^{4}

59951 in other forms

FormValue
In wordsfifty-nine thousand nine hundred and fifty-one
Binary (base 2)1110101000101111
Octal (base 8)165057
Hexadecimal (base 16)EA2F
Base 310001020102
As time59951 seconds = 16 h 39 min 11 s

Is 59951 divisible by 2 to 12?

DivisorAnswerRule
2No (remainder 1)A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8).
3No (remainder 2)A number is divisible by 3 if the digits add up to a multiple of 3.
4No (remainder 3)A number is divisible by 4 if the last two digits make a multiple of 4.
5No (remainder 1)A number is divisible by 5 if the last digit is 0 or 5.
6No (remainder 5)A number is divisible by 6 if it is divisible by both 2 and 3.
7No (remainder 3)A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7.
8No (remainder 7)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 2)A number is divisible by 9 if the digits add up to a multiple of 9.
10No (remainder 1)A number is divisible by 10 if the last digit is 0.
11No (remainder 1)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 11)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 59951 a prime number?

Yes. 59951 is divisible only by 1 and itself.

What are the factors of 59951?

1, 59951.

What is 59951 in binary?

1110101000101111 (hexadecimal EA2F, octal 165057).

What is the square root of 59951?

About 244.8489.

Is 59951 divisible by 3?

No. Its digits add up to 29, which is not a multiple of 3.

What is special about the number 59951?

59951 is the 6053rd prime number.

All about 59951

Find the next one

Nearby numbers

    59951: is it prime? Factors, square root, binary, Roman numeral | WordGPT