Recognised as Number

29,564

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value29,564

Digit count5

Digit sum26

Digit product2,160

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 factorisation2^2 × 19 × 389

Distinct prime factors32, 19, 389

Number of divisors12

Sum of divisors σ(n)54,600

Aliquot sum25,036sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 19, 38, 76, 389, 778, 1,556, 7,391, 14,782, 29,56412 in total

Arithmetic

Previous number29,563

Next number29,565

Double59,128

Half14,782

Square874,030,096

Cube25,839,825,758,144

Square root171.941850636≈irrational, shown to 9 decimal places

Cube root30.921061736≈

Negation-29,564

Reciprocal0.0000338249≈

Representations

Decimal29,564

Binary11100110111110015 bits

Octal71574

Hexadecimal737C

Base 36MT8

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

In wordstwenty-nine thousand, five hundred and sixty-four

Ordinaltwenty-nine thousand, five hundred and sixty-fourth

Scientific notation2.9564 × 10^4

Engineering notation29.564 × 10^3

In other bases

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

Quinary1421224base 5; one hand: 7 digits

Septenary152123base 7: 6 digits

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

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

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

Sexagesimal8:12:44base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0111001101111100

Bit length15 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits5within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes273 7c

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

At each machine width

16-bit0111001101111100

32-bit00000000000000000111001101111100

64-bit0000000000000000000000000000000000000000000000000111001101111100

One's complement1000110010000011at 16 bits, every bit flipped

Bits reversed0011111011001110at 16 bits

Rotated left by 11110011011111000at 16 bits, wrapping

Shifted left by 11110011011111000= 59,128, no wrap

Shifted right by 111100110111110= 14,782, discarding the low bit

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

Nearest landmarks

Next prime29,567+3

Previous prime29,537−27

Distance to nearest prime3

Nearest square below29,241

Nearest square above29,584

Powers & multiples

29,564 to the power 2874,030,096

29,564 to the power 325,839,825,758,144

29,564 to the power 4763,928,608,713,769,216

29,564 to the power 522,584,785,388,013,873,101,824

First ten multiples29,564, 59,128, 88,692, 118,256, 147,820, 177,384, 206,948, 236,512, 266,076, 295,640

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

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 7No, remainder 3

Divisible by 8No, remainder 4

Divisible by 9No, remainder 8

Divisible by 10No, remainder 4

Divisible by 11No, remainder 7

Divisible by 12No, remainder 8

Divisible by 100No, remainder 64

Collatz (3n + 1) trajectory

Steps to reach 1209the total stopping time

Highest value reached250,5048× the starting value

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

First steps29,564 → 14,782 → 7,391 → 22,174 → 11,087 → 33,262 → 16,631 → 49,894 → 24,947 → 74,842 → …

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

As a percentage & fraction

As a percentage2,956,400%

29,564% as a decimal295.64

29,564% of 10029,564

29,564% of 1,000295,640

As a fraction of 10029,564/100

Read another way

As seconds8 hours, 12 minutes and 44 seconds

As bytes28.871 KiB

As a 24-bit colour#00737C

Keep nerding

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