Nerdulator> put something in

Number

51,061

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value51,061
Digit count5
Digit sum13
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation51,061
Distinct prime factors151,061
Number of divisors2
Sum of divisors σ(n)51,062
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)51,060integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 51,0612 in total

Arithmetic

Previous number51,060
Next number51,062
Double102,122
Square root225.966811722irrational, shown to 9 decimal places
Cube root37.099077045
Negation-51,061
Reciprocal0.0000195844

Representations

Decimal51,061
Binary110001110111010116 bits
Octal143565
HexadecimalC775
Base 3613ED
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-one thousand and sixty-one
Ordinalfifty-one thousand and sixty-first
Scientific notation5.1061 × 10^4
Engineering notation51.061 × 10^3

Nearest landmarks

Next prime51,071+10
Previous prime51,059−2
Distance to nearest prime0, it is prime
Nearest square below50,625
Nearest square above51,076

Powers & multiples

51,061 to the power 22,607,225,721
51,061 to the power 3133,127,552,539,981
51,061 to the power 46,797,625,960,243,969,841
51,061 to the power 5347,093,579,156,017,344,051,301
First ten multiples51,061, 102,122, 153,183, 204,244, 255,305, 306,366, 357,427, 408,488, 459,549, 510,610
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 178the total stopping time
Highest value reached153,1843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps51,061 → 153,184 → 76,592 → 38,296 → 19,148 → 9,574 → 4,787 → 14,362 → 7,181 → 21,544 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,106,100%
51,061% as a decimal510.61
51,061% of 10051,061
51,061% of 1,000510,610
As a fraction of 10051,061/100

Read another way

As bytes49.864 KiB
As a 24-bit colour#00C775

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