WordGPT

The number 51481

51481 is a twin prime (51479 and 51481 are both prime) and the 5269th prime number. Its only divisors are 1 and 51481.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 51481: a twin prime (51479 and 51481 are both prime); the 5269th prime number.

  2. 2

    51481 is prime, so its only factors are 1 and 51481. It is the 5269th prime; the next prime is 51487 and the one before is 51479.

  3. 3

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

  4. 4

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

51481 at a glance

PropertyValue
Typeprime
Number of divisors2
Sum of divisors51482
Euler totient φ(n)51480
Square2650293361
Cube136439752517641
Square root226.894248
Digit sum / digital root19 / 1
Collatz steps to 152
Scientific notation5.1481 × 10410^{4}

51481 in other forms

FormValue
In wordsfifty-one thousand four hundred and eighty-one
Binary (base 2)1100100100011001
Octal (base 8)144431
Hexadecimal (base 16)C919
Base 32121121201
As time51481 seconds = 14 h 18 min 1 s

Is 51481 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 1)A number is divisible by 3 if the digits add up to a multiple of 3.
4No (remainder 1)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 1)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 1)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 1)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 1)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 51481 a prime number?

Yes. 51481 is divisible only by 1 and itself.

What are the factors of 51481?

1, 51481.

What is 51481 in binary?

1100100100011001 (hexadecimal C919, octal 144431).

What is the square root of 51481?

About 226.8942.

Is 51481 divisible by 3?

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

What is special about the number 51481?

51481 is a twin prime (51479 and 51481 are both prime); the 5269th prime number.

All about 51481

Find the next one

Nearby numbers

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