Recognised as Number

57,653

Positive
Odd
Prime
5 digits

57,653 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value57,653

Digit count5

Digit sum26

Digit product3,150

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation57,653

Distinct prime factors157,653

Number of divisors2

Sum of divisors σ(n)57,654

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)57,652the 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, 57,6532 in total

Arithmetic

Previous number57,652

Next number57,654

Double115,306

Half28,826.5

Square3,323,868,409

Cube191,630,985,384,077

Square root240.110391279≈irrational, shown to 9 decimal places

Cube root38.631416877≈

Negation-57,653

Reciprocal0.0000173452≈

Representations

Decimal57,653

Binary111000010011010116 bits

Octal160465

HexadecimalE135

Base 3618HH

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

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

Ordinalfifty-seven thousand, six hundred and fifty-third

Scientific notation5.7653 × 10^4

Engineering notation57.653 × 10^3

In other bases

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

Quinary3321103base 5; one hand: 7 digits

Septenary330041base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110000100110101

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

Bit parityeven8 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

Bytes2e1 35

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

At each machine width

16-bit1110000100110101

32-bit00000000000000001110000100110101

64-bit0000000000000000000000000000000000000000000000001110000100110101

One's complement0001111011001010at 16 bits, every bit flipped

Bits reversed1010110010000111at 16 bits

Rotated left by 11100001001101011at 16 bits, wrapping

Shifted left by 111100001001101010= 115,306, no wrap

Shifted right by 1111000010011010= 28,826, discarding the low bit

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

Nearest landmarks

Next prime57,667+14

Previous prime57,649−4

Distance to nearest prime0, it is prime

Nearest square below57,600

Nearest square above58,081

Powers & multiples

57,653 to the power 23,323,868,409

57,653 to the power 3191,630,985,384,077

57,653 to the power 411,048,101,200,348,191,281

57,653 to the power 5636,956,178,503,674,271,923,493

First ten multiples57,653, 115,306, 172,959, 230,612, 288,265, 345,918, 403,571, 461,224, 518,877, 576,530

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 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 2

Divisible by 12No, remainder 5

Divisible by 100No, remainder 53

Collatz (3n + 1) trajectory

Steps to reach 1166the total stopping time

Highest value reached172,9603× the starting value

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

First steps57,653 → 172,960 → 86,480 → 43,240 → 21,620 → 10,810 → 5,405 → 16,216 → 8,108 → 4,054 → …

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

As a percentage & fraction

As a percentage5,765,300%

57,653% as a decimal576.53

57,653% of 10057,653

57,653% of 1,000576,530

As a fraction of 10057,653/100

Read another way

As seconds16 hours and 53 seconds

As bytes56.302 KiB

As a 24-bit colour#00E135

Keep nerding

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