Recognised as Number

51,055

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value51,055

Digit count5

Digit sum16

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 10,211

Distinct prime factors25, 10,211

Number of divisors4

Sum of divisors σ(n)61,272

Aliquot sum10,217sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)20,420the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 40,840

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 10,211, 51,0554 in total

Arithmetic

Previous number51,054

Next number51,056

Double102,110

Half25,527.5

Square2,606,613,025

Cube133,080,627,991,375

Square root225.953535046≈irrational, shown to 9 decimal places

Cube root37.09762386≈

Negation-51,055

Reciprocal0.0000195867≈

Representations

Decimal51,055

Binary110001110110111116 bits

Octal143557

HexadecimalC76F

Base 3613E7

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

In wordsfifty-one thousand and fifty-five

Ordinalfifty-one thousand and fifty-fifth

Scientific notation5.1055 × 10^4

Engineering notation51.055 × 10^3

In other bases

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

Quinary3113210base 5; one hand: 7 digits

Septenary301564base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100011101101111

Bit length16 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits5within that length

Bit parityodd11 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 6f

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

At each machine width

16-bit1100011101101111

32-bit00000000000000001100011101101111

64-bit0000000000000000000000000000000000000000000000001100011101101111

One's complement0011100010010000at 16 bits, every bit flipped

Bits reversed1111011011100011at 16 bits

Rotated left by 11000111011011111at 16 bits, wrapping

Shifted left by 111000111011011110= 102,110, no wrap

Shifted right by 1110001110110111= 25,527, discarding the low bit

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

Nearest landmarks

Next prime51,059+4

Previous prime51,047−8

Distance to nearest prime4

Nearest square below50,625

Nearest square above51,076

Powers & multiples

51,055 to the power 22,606,613,025

51,055 to the power 3133,080,627,991,375

51,055 to the power 46,794,431,462,099,650,625

51,055 to the power 5346,889,698,297,497,662,659,375

First ten multiples51,055, 102,110, 153,165, 204,220, 255,275, 306,330, 357,385, 408,440, 459,495, 510,550

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 3

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 7

Divisible by 10No, remainder 5

Divisible by 11No, remainder 4

Divisible by 12No, remainder 7

Divisible by 100No, remainder 55

Collatz (3n + 1) trajectory

Steps to reach 183the total stopping time

Highest value reached581,56011× the starting value

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

First steps51,055 → 153,166 → 76,583 → 229,750 → 114,875 → 344,626 → 172,313 → 516,940 → 258,470 → 129,235 → …

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

As a percentage & fraction

As a percentage5,105,500%

51,055% as a decimal510.55

51,055% of 10051,055

51,055% of 1,000510,550

As a fraction of 10051,055/100

Read another way

As seconds14 hours, 10 minutes and 55 seconds

As bytes49.858 KiB

As a 24-bit colour#00C76F

Keep nerding

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