Recognised as Number

51,511

Positive
Odd
Prime
5 digits

51,511 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,511

Digit count5

Digit sum13

Digit product25

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation51,511

Distinct prime factors151,511

Number of divisors2

Sum of divisors σ(n)51,512

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)51,510the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 51,5112 in total

Arithmetic

Previous number51,510

Next number51,512

Double103,022

Half25,755.5

Square2,653,383,121

Cube136,678,417,945,831

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

Cube root37.207743022≈

Negation-51,511

Reciprocal0.0000194133≈

Representations

Decimal51,511

Binary110010010011011116 bits

Octal144467

HexadecimalC937

Base 3613QV

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

In wordsfifty-one thousand, five hundred and eleven

Ordinalfifty-one thousand, five hundred and eleventh

Scientific notation5.1511 × 10^4

Engineering notation51.511 × 10^3

In other bases

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

Quinary3122021base 5; one hand: 7 digits

Septenary303115base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100100100110111

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

Bytes2c9 37

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

At each machine width

16-bit1100100100110111

32-bit00000000000000001100100100110111

64-bit0000000000000000000000000000000000000000000000001100100100110111

One's complement0011011011001000at 16 bits, every bit flipped

Bits reversed1110110010010011at 16 bits

Rotated left by 11001001001101111at 16 bits, wrapping

Shifted left by 111001001001101110= 103,022, no wrap

Shifted right by 1110010010011011= 25,755, discarding the low bit

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

Nearest landmarks

Next prime51,517+6

Previous prime51,503−8

Distance to nearest prime0, it is prime

Nearest square below51,076

Nearest square above51,529

Powers & multiples

51,511 to the power 22,653,383,121

51,511 to the power 3136,678,417,945,831

51,511 to the power 47,040,441,986,807,700,641

51,511 to the power 5362,660,207,182,451,467,718,551

First ten multiples51,511, 103,022, 154,533, 206,044, 257,555, 309,066, 360,577, 412,088, 463,599, 515,110

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 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 9

Divisible by 12No, remainder 7

Divisible by 100No, remainder 11

Collatz (3n + 1) trajectory

Steps to reach 1114the total stopping time

Highest value reached846,91616× the starting value

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

First steps51,511 → 154,534 → 77,267 → 231,802 → 115,901 → 347,704 → 173,852 → 86,926 → 43,463 → 130,390 → …

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

As a percentage & fraction

As a percentage5,151,100%

51,511% as a decimal515.11

51,511% of 10051,511

51,511% of 1,000515,110

As a fraction of 10051,511/100

Read another way

As seconds14 hours, 18 minutes and 31 seconds

As bytes50.304 KiB

As a 24-bit colour#00C937

Keep nerding

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