Recognised as Number

29,771

Positive
Odd
Composite
5 digits

29,771 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value29,771

Digit count5

Digit sum26

Digit product882

Multiplicative persistence4times 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 factorisation7 × 4,253

Distinct prime factors27, 4,253

Number of divisors4

Sum of divisors σ(n)34,032

Aliquot sum4,261sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)12,756the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 25,512

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 7, 4,253, 29,7714 in total

Arithmetic

Previous number29,770

Next number29,772

Double59,542

Half14,885.5

Square886,312,441

Cube26,386,407,681,011

Square root172.542748326≈irrational, shown to 9 decimal places

Cube root30.993061229≈

Negation-29,771

Reciprocal0.0000335897≈

Representations

Decimal29,771

Binary11101000100101115 bits

Octal72113

Hexadecimal744B

Base 36MYZ

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

In wordstwenty-nine thousand, seven hundred and seventy-one

Ordinaltwenty-nine thousand, seven hundred and seventy-first

Scientific notation2.9771 × 10^4

Engineering notation29.771 × 10^3

In other bases

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

Quinary1423041base 5; one hand: 7 digits

Septenary152540base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111010001001011

Bit length15 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits7within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes274 4b

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

At each machine width

16-bit0111010001001011

32-bit00000000000000000111010001001011

64-bit0000000000000000000000000000000000000000000000000111010001001011

One's complement1000101110110100at 16 bits, every bit flipped

Bits reversed1101001000101110at 16 bits

Rotated left by 11110100010010110at 16 bits, wrapping

Shifted left by 11110100010010110= 59,542, no wrap

Shifted right by 111101000100101= 14,885, discarding the low bit

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

Nearest landmarks

Next prime29,789+18

Previous prime29,761−10

Distance to nearest prime10

Nearest square below29,584

Nearest square above29,929

Powers & multiples

29,771 to the power 2886,312,441

29,771 to the power 326,386,407,681,011

29,771 to the power 4785,549,743,071,378,481

29,771 to the power 523,386,601,400,978,008,757,851

First ten multiples29,771, 59,542, 89,313, 119,084, 148,855, 178,626, 208,397, 238,168, 267,939, 297,710

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 3

Divisible by 9No, remainder 8

Divisible by 10No, remainder 1

Divisible by 11No, remainder 5

Divisible by 12No, remainder 11

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 1134the total stopping time

Highest value reached133,9724× the starting value

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

First steps29,771 → 89,314 → 44,657 → 133,972 → 66,986 → 33,493 → 100,480 → 50,240 → 25,120 → 12,560 → …

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

As a percentage & fraction

As a percentage2,977,100%

29,771% as a decimal297.71

29,771% of 10029,771

29,771% of 1,000297,710

As a fraction of 10029,771/100

Read another way

As seconds8 hours, 16 minutes and 11 seconds

As bytes29.073 KiB

As a 24-bit colour#00744B

Keep nerding

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