Nerdulator> put something in

Recognised as Number

53,564

  • Positive
  • Even
  • Composite
  • 5 digits

53,564 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value53,564
Digit count5
Digit sum23
Digit product1,800
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 7 × 1,913
Distinct prime factors32, 7, 1,913
Number of divisors12
Sum of divisors σ(n)107,184
Aliquot sum53,620sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)22,944integers below n that share no factor with it
Carmichael function λ(n)5,736the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 22,944
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 14, 28, 1,913, 3,826, 7,652, 13,391, 26,782, 53,56412 in total

Arithmetic

Previous number53,563
Next number53,565
Double107,128
Half26,782
Square root231.438976838≈irrational, shown to 9 decimal places
Cube root37.69562952≈
Negation-53,564
Reciprocal0.0000186693≈

Representations

Decimal53,564
Binary110100010011110016 bits
Octal150474
HexadecimalD13C
Base 3615BW
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-three thousand, five hundred and sixty-four
Ordinalfifty-three thousand, five hundred and sixty-fourth
Scientific notation5.3564 × 10^4
Engineering notation53.564 × 10^3

In other bases

Ternary2201110212base 3; the most digit-efficient integer base after e: 10 digits
Quinary3203224base 5; one hand: 7 digits
Septenary312110base 7: 6 digits
Nonary81425base 9; each digit is two ternary digits: 5 digits
Duodecimal26bb8base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal6di4base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal14:52:44base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10T011110TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101000101001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1101000100111100
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 even
Highest set bitbit 15worth 32,768
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes2d1 3c
Gray code1011100110100010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101000100111100
32-bit00000000000000001101000100111100
64-bit0000000000000000000000000000000000000000000000001101000100111100
One's complement0010111011000011at 16 bits, every bit flipped
Bits reversed0011110010001011at 16 bits
Rotated left by 11010001001111001at 16 bits, wrapping
Shifted left by 111010001001111000= 107,128, no wrap
Shifted right by 1110100010011110= 26,782, discarding the low bit
These bits as a double2.64641323 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime53,569+5
Previous prime53,551−13
Distance to nearest prime5
Nearest square below53,361
Nearest square above53,824

Powers & multiples

53,564 to the power 22,869,102,096
53,564 to the power 3153,680,584,670,144
53,564 to the power 48,231,746,837,271,593,216
53,564 to the power 5440,925,287,591,615,619,021,824
First ten multiples53,564, 107,128, 160,692, 214,256, 267,820, 321,384, 374,948, 428,512, 482,076, 535,640
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 4
Divisible by 9No, remainder 5
Divisible by 10No, remainder 4
Divisible by 11No, remainder 5
Divisible by 12No, remainder 8
Divisible by 100No, remainder 64

Collatz (3n + 1) trajectory

Steps to reach 147the total stopping time
Highest value reached135,5922× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps53,564 → 26,782 → 13,391 → 40,174 → 20,087 → 60,262 → 30,131 → 90,394 → 45,197 → 135,592 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,356,400%
53,564% as a decimal535.64
53,564% of 10053,564
53,564% of 1,000535,640
As a fraction of 10053,564/100

Read another way

As bytes52.309 KiB
As a 24-bit colour#00D13C

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “53564” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.