Nerdulator> put something in

Number

52,391

  • Positive
  • Odd
  • Prime
  • 5 digits

52,391 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value52,391
Digit count5
Digit sum20
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation52,391
Distinct prime factors152,391
Number of divisors2
Sum of divisors σ(n)52,392
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)52,390integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 52,3912 in total

Arithmetic

Previous number52,390
Next number52,392
Double104,782
Square root228.89080366irrational, shown to 9 decimal places
Cube root37.418430105
Negation-52,391
Reciprocal0.0000190872

Representations

Decimal52,391
Binary110011001010011116 bits
Octal146247
HexadecimalCCA7
Base 3614FB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-two thousand, three hundred and ninety-one
Ordinalfifty-two thousand, three hundred and ninety-first
Scientific notation5.2391 × 10^4
Engineering notation52.391 × 10^3

Nearest landmarks

Next prime52,433+42
Previous prime52,387−4
Distance to nearest prime0, it is prime
Nearest square below51,984
Nearest square above52,441

Powers & multiples

52,391 to the power 22,744,816,881
52,391 to the power 3143,803,701,212,471
52,391 to the power 47,534,019,710,222,568,161
52,391 to the power 5394,714,826,638,270,568,522,951
First ten multiples52,391, 104,782, 157,173, 209,564, 261,955, 314,346, 366,737, 419,128, 471,519, 523,910
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1109the total stopping time
Highest value reached806,59615× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps52,391 → 157,174 → 78,587 → 235,762 → 117,881 → 353,644 → 176,822 → 88,411 → 265,234 → 132,617 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,239,100%
52,391% as a decimal523.91
52,391% of 10052,391
52,391% of 1,000523,910
As a fraction of 10052,391/100

Read another way

As bytes51.163 KiB
As a 24-bit colour#00CCA7

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