WordGPT

The number 46513

46513 is a composite number with 4 divisors. Its prime factorisation is 193 × 241. Divisors (4): 1, 193, 241, 46513.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 46513: a semiprime: 193 × 241, the product of two primes.

  2. 2

    46513 is composite. Its prime factorisation is

    46513=193×24146513 = 193 \times 241
  3. 3

    The divisors add up to 46948; without 46513 itself that is 435, so 46513 is deficient (435 is less than 46513). Euler's totient φ(46513) = 46080 numbers up to 46513 share no factor with it.

  4. 4

    The digits of 46513 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.

LaTeX source of the formulas on this page
\[ 46513 = 193 \times 241 \]

46513 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors46948
Euler totient φ(n)46080
Square2163459169
Cube100628976327697
Square root215.668727
Digit sum / digital root19 / 1
Collatz steps to 152
Scientific notation4.6513 × 10410^{4}

46513 in other forms

FormValue
In wordsforty-six thousand five hundred and thirteen
Binary (base 2)1011010110110001
Octal (base 8)132661
Hexadecimal (base 16)B5B1
Base 32100210201
As time46513 seconds = 12 h 55 min 13 s

Is 46513 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 3)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 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 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 3)A number is divisible by 10 if the last digit is 0.
11No (remainder 5)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 46513 a prime number?

No. 46513 = 193 × 241, so it is divisible by 193.

What are the factors of 46513?

1, 193, 241, 46513.

What is 46513 in binary?

1011010110110001 (hexadecimal B5B1, octal 132661).

What is the square root of 46513?

About 215.6687.

Is 46513 divisible by 3?

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

What is special about the number 46513?

46513 is a semiprime: 193 × 241, the product of two primes.

Find the next one

Nearby numbers

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