Recognised as Number

64,356

Positive
Even
Composite
5 digits

64,356 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value64,356

Digit count5

Digit sum24

Digit product2,160

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3 × 31 × 173

Distinct prime factors42, 3, 31, 173

Number of divisors24

Sum of divisors σ(n)155,904

Aliquot sum91,548sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 12, 31, 62, 93, 124, 173, 186, 346, 372, 519, 692, 1,038, 2,076, 5,363, 10,726, 16,089, 21,452, 32,178, 64,35624 in total

Arithmetic

Previous number64,355

Next number64,357

Double128,712

Half32,178

Square4,141,694,736

Cube266,542,906,430,016

Square root253.684843852≈irrational, shown to 9 decimal places

Cube root40.074029573≈

Negation-64,356

Reciprocal0.0000155386≈

Representations

Decimal64,356

Binary111110110110010016 bits

Octal175544

HexadecimalFB64

Base 361DNO

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

In wordssixty-four thousand, three hundred and fifty-six

Ordinalsixty-four thousand, three hundred and fifty-sixth

Scientific notation6.4356 × 10^4

Engineering notation64.356 × 10^3

In other bases

Ternary10021021120base 3; the most digit-efficient integer base after e: 11 digits

Quinary4024411base 5; one hand: 7 digits

Septenary355425base 7: 6 digits

Nonary107246base 9; each digit is two ternary digits: 6 digits

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

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

Sexagesimal17:52:36base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1111101101100100

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

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

Bytes2fb 64

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

At each machine width

16-bit1111101101100100

32-bit00000000000000001111101101100100

64-bit0000000000000000000000000000000000000000000000001111101101100100

One's complement0000010010011011at 16 bits, every bit flipped

Bits reversed0010011011011111at 16 bits

Rotated left by 11111011011001001at 16 bits, wrapping

Shifted left by 111111011011001000= 128,712, no wrap

Shifted right by 1111110110110010= 32,178, discarding the low bit

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

Nearest landmarks

Next prime64,373+17

Previous prime64,333−23

Distance to nearest prime17

Nearest square below64,009

Nearest square above64,516

Powers & multiples

64,356 to the power 24,141,694,736

64,356 to the power 3266,542,906,430,016

64,356 to the power 417,153,635,286,210,109,696

64,356 to the power 51,103,939,352,479,337,819,595,776

First ten multiples64,356, 128,712, 193,068, 257,424, 321,780, 386,136, 450,492, 514,848, 579,204, 643,560

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 1

Divisible by 6Yes

Divisible by 7No, remainder 5

Divisible by 8No, remainder 4

Divisible by 9No, remainder 6

Divisible by 10No, remainder 6

Divisible by 11No, remainder 6

Divisible by 12Yes

Divisible by 100No, remainder 56

Collatz (3n + 1) trajectory

Steps to reach 147the total stopping time

Highest value reached64,356

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

First steps64,356 → 32,178 → 16,089 → 48,268 → 24,134 → 12,067 → 36,202 → 18,101 → 54,304 → 27,152 → …

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

As a percentage & fraction

As a percentage6,435,600%

64,356% as a decimal643.56

64,356% of 10064,356

64,356% of 1,000643,560

As a fraction of 10064,356/100

Read another way

As seconds17 hours, 52 minutes and 36 seconds

As bytes62.848 KiB

As a 24-bit colour#00FB64

Keep nerding

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