Recognised as Number

57,351

Positive
Odd
Composite
5 digits

57,351 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value57,351

Digit count5

Digit sum21

Digit product525

Multiplicative persistence3times 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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 7 × 2,731

Distinct prime factors33, 7, 2,731

Number of divisors8

Sum of divisors σ(n)87,424

Aliquot sum30,073sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,730the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 32,760

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 7, 21, 2,731, 8,193, 19,117, 57,3518 in total

Arithmetic

Previous number57,350

Next number57,352

Double114,702

Half28,675.5

Square3,289,137,201

Cube188,635,307,614,551

Square root239.480688157≈irrational, shown to 9 decimal places

Cube root38.563845266≈

Negation-57,351

Reciprocal0.0000174365≈

Representations

Decimal57,351

Binary111000000000011116 bits

Octal160007

HexadecimalE007

Base 361893

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

In wordsfifty-seven thousand, three hundred and fifty-one

Ordinalfifty-seven thousand, three hundred and fifty-first

Scientific notation5.7351 × 10^4

Engineering notation57.351 × 10^3

In other bases

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

Quinary3313401base 5; one hand: 7 digits

Septenary326130base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110000000000111

Bit length16 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits10within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2e0 07

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

At each machine width

16-bit1110000000000111

32-bit00000000000000001110000000000111

64-bit0000000000000000000000000000000000000000000000001110000000000111

One's complement0001111111111000at 16 bits, every bit flipped

Bits reversed1110000000000111at 16 bits

Rotated left by 11100000000001111at 16 bits, wrapping

Shifted left by 111100000000001110= 114,702, no wrap

Shifted right by 1111000000000011= 28,675, discarding the low bit

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

Nearest landmarks

Next prime57,367+16

Previous prime57,349−2

Distance to nearest prime2

Nearest square below57,121

Nearest square above57,600

Powers & multiples

57,351 to the power 23,289,137,201

57,351 to the power 3188,635,307,614,551

57,351 to the power 410,818,423,527,002,114,401

57,351 to the power 5620,447,407,697,098,263,011,751

First ten multiples57,351, 114,702, 172,053, 229,404, 286,755, 344,106, 401,457, 458,808, 516,159, 573,510

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9No, remainder 3

Divisible by 10No, remainder 1

Divisible by 11No, remainder 8

Divisible by 12No, remainder 3

Divisible by 100No, remainder 51

Collatz (3n + 1) trajectory

Steps to reach 178the total stopping time

Highest value reached387,1246× the starting value

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

First steps57,351 → 172,054 → 86,027 → 258,082 → 129,041 → 387,124 → 193,562 → 96,781 → 290,344 → 145,172 → …

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

As a percentage & fraction

As a percentage5,735,100%

57,351% as a decimal573.51

57,351% of 10057,351

57,351% of 1,000573,510

As a fraction of 10057,351/100

Read another way

As seconds15 hours, 55 minutes and 51 seconds

As bytes56.007 KiB

As a 24-bit colour#00E007

Keep nerding

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