Recognised as Number

51,113

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value51,113

Digit count5

Digit sum11

Digit product15

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation79 × 647

Distinct prime factors279, 647

Number of divisors4

Sum of divisors σ(n)51,840

Aliquot sum727sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)50,388integers below n that share no factor with it

Carmichael function λ(n)25,194the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 50,388

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 79, 647, 51,1134 in total

Arithmetic

Previous number51,112

Next number51,114

Double102,226

Half25,556.5

Square2,612,538,769

Cube133,534,694,099,897

Square root226.081843588≈irrational, shown to 9 decimal places

Cube root37.111666545≈

Negation-51,113

Reciprocal0.0000195645≈

Representations

Decimal51,113

Binary110001111010100116 bits

Octal143651

HexadecimalC7A9

Base 3613FT

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsfifty-one thousand, one hundred and thirteen

Ordinalfifty-one thousand, one hundred and thirteenth

Scientific notation5.1113 × 10^4

Engineering notation51.113 × 10^3

In other bases

Ternary2121010002base 3; the most digit-efficient integer base after e: 10 digits

Quinary3113423base 5; one hand: 7 digits

Septenary302006base 7: 6 digits

Nonary77102base 9; each digit is two ternary digits: 5 digits

Duodecimal256b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal67fdbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal14:11:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary10TT101001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11101100011111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1100011110101001

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2c7 a9

Gray code1010010001111101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100011110101001

32-bit00000000000000001100011110101001

64-bit0000000000000000000000000000000000000000000000001100011110101001

One's complement0011100001010110at 16 bits, every bit flipped

Bits reversed1001010111100011at 16 bits

Rotated left by 11000111101010011at 16 bits, wrapping

Shifted left by 111000111101010010= 102,226, no wrap

Shifted right by 1110001111010100= 25,556, discarding the low bit

These bits as a double2.52531774 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime51,131+18

Previous prime51,109−4

Distance to nearest prime4

Nearest square below51,076

Nearest square above51,529

Powers & multiples

51,113 to the power 22,612,538,769

51,113 to the power 3133,534,694,099,897

51,113 to the power 46,825,358,819,528,035,361

51,113 to the power 5348,864,565,342,536,471,406,793

First ten multiples51,113, 102,226, 153,339, 204,452, 255,565, 306,678, 357,791, 408,904, 460,017, 511,130

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 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 1

Divisible by 9No, remainder 2

Divisible by 10No, remainder 3

Divisible by 11No, remainder 7

Divisible by 12No, remainder 5

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1140the total stopping time

Highest value reached3,315,97664× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps51,113 → 153,340 → 76,670 → 38,335 → 115,006 → 57,503 → 172,510 → 86,255 → 258,766 → 129,383 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,111,300%

51,113% as a decimal511.13

51,113% of 10051,113

51,113% of 1,000511,130

As a fraction of 10051,113/100

Read another way

As seconds14 hours, 11 minutes and 53 seconds

As bytes49.915 KiB

As a 24-bit colour#00C7A9

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.