WordGPT

The number 95002

95002 is a composite number with 4 divisors. Its prime factorisation is 2 × 47501. Divisors (4): 1, 2, 47501, 95002.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 95002: a semiprime: 2 × 47501, the product of two primes.

  2. 2

    95002 is composite. Its prime factorisation is

    95002=2×4750195002 = 2 \times 47501
  3. 3

    The divisors add up to 142506; without 95002 itself that is 47504, so 95002 is deficient (47504 is less than 95002). Euler's totient φ(95002) = 47500 numbers up to 95002 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 95002 = 2 \times 47501 \]

95002 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors142506
Euler totient φ(n)47500
Square9025380004
Cube857429151140008
Square root308.223945
Digit sum / digital root16 / 7
Collatz steps to 1146
Scientific notation9.5002 × 10410^{4}

95002 in other forms

FormValue
In wordsninety-five thousand and two
Binary (base 2)10111001100011010
Octal (base 8)271432
Hexadecimal (base 16)1731A
Base 311211022121
As time95002 seconds = 26 h 23 min 22 s

Is 95002 divisible by 2 to 12?

DivisorAnswerRule
2Yes (95002 ÷ 2 = 47501)A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8).
3No (remainder 1)A number is divisible by 3 if the digits add up to a multiple of 3.
4No (remainder 2)A number is divisible by 4 if the last two digits make a multiple of 4.
5No (remainder 2)A number is divisible by 5 if the last digit is 0 or 5.
6No (remainder 4)A number is divisible by 6 if it is divisible by both 2 and 3.
7No (remainder 5)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 2)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 7)A number is divisible by 9 if the digits add up to a multiple of 9.
10No (remainder 2)A number is divisible by 10 if the last digit is 0.
11No (remainder 6)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 10)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 95002 a prime number?

No. 95002 = 2 × 47501, so it is divisible by 2.

What are the factors of 95002?

1, 2, 47501, 95002.

What is 95002 in binary?

10111001100011010 (hexadecimal 1731A, octal 271432).

What is the square root of 95002?

About 308.2239.

Is 95002 divisible by 3?

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

What is special about the number 95002?

95002 is a semiprime: 2 × 47501, the product of two primes.

Find the next one

Nearby numbers

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