Recognised as Number

51,114

Positive
Even
Composite
5 digits

51,114 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value51,114

Digit count5

Digit sum12

Digit product20

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 7 × 1,217

Distinct prime factors42, 3, 7, 1,217

Number of divisors16

Sum of divisors σ(n)116,928

Aliquot sum65,814sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)3,648the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 14,592

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 7, 14, 21, 42, 1,217, 2,434, 3,651, 7,302, 8,519, 17,038, 25,557, 51,11416 in total

Arithmetic

Previous number51,113

Next number51,115

Double102,228

Half25,557

Square2,612,640,996

Cube133,542,531,869,544

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

Cube root37.111908568≈

Negation-51,114

Reciprocal0.0000195641≈

Representations

Decimal51,114

Binary110001111010101016 bits

Octal143652

HexadecimalC7AA

Base 3613FU

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

In wordsfifty-one thousand, one hundred and fourteen

Ordinalfifty-one thousand, one hundred and fourteenth

Scientific notation5.1114 × 10^4

Engineering notation51.114 × 10^3

In other bases

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

Quinary3113424base 5; one hand: 7 digits

Septenary302010base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100011110101010

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 even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2c7 aa

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

At each machine width

16-bit1100011110101010

32-bit00000000000000001100011110101010

64-bit0000000000000000000000000000000000000000000000001100011110101010

One's complement0011100001010101at 16 bits, every bit flipped

Bits reversed0101010111100011at 16 bits

Rotated left by 11000111101010101at 16 bits, wrapping

Shifted left by 111000111101010100= 102,228, no wrap

Shifted right by 1110001111010101= 25,557, discarding the low bit

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

Nearest landmarks

Next prime51,131+17

Previous prime51,109−5

Distance to nearest prime5

Nearest square below51,076

Nearest square above51,529

Powers & multiples

51,114 to the power 22,612,640,996

51,114 to the power 3133,542,531,869,544

51,114 to the power 46,825,892,973,979,872,016

51,114 to the power 5348,898,693,472,007,178,225,824

First ten multiples51,114, 102,228, 153,342, 204,456, 255,570, 306,684, 357,798, 408,912, 460,026, 511,140

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 4

Divisible by 6Yes

Divisible by 7Yes

Divisible by 8No, remainder 2

Divisible by 9No, remainder 3

Divisible by 10No, remainder 4

Divisible by 11No, remainder 8

Divisible by 12No, remainder 6

Divisible by 100No, remainder 14

Collatz (3n + 1) trajectory

Steps to reach 1127the total stopping time

Highest value reached76,6721× the starting value

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

First steps51,114 → 25,557 → 76,672 → 38,336 → 19,168 → 9,584 → 4,792 → 2,396 → 1,198 → 599 → …

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

As a percentage & fraction

As a percentage5,111,400%

51,114% as a decimal511.14

51,114% of 10051,114

51,114% of 1,000511,140

As a fraction of 10051,114/100

Read another way

As seconds14 hours, 11 minutes and 54 seconds

As bytes49.916 KiB

As a 24-bit colour#00C7AA

Keep nerding

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