Nerdulator> put something in

Recognised as Number

29,772

  • Positive
  • Even
  • Composite
  • 5 digits

29,772 is an even 5-digit integer and a composite number. It has 18 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value29,772
Digit count5
Digit sum27
Digit product1,764
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3^2 × 827
Distinct prime factors32, 3, 827
Number of divisors18
Sum of divisors σ(n)75,348
Aliquot sum45,576sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)9,912integers below n that share no factor with it
Carmichael function λ(n)2,478the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 9,912
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 9, 12, 18, 36, 827, 1,654, 2,481, 3,308, 4,962, 7,443, 9,924, 14,886, 29,77218 in total

Arithmetic

Previous number29,771
Next number29,773
Double59,544
Half14,886
Square root172.545646135≈irrational, shown to 9 decimal places
Cube root30.993408241≈
Negation-29,772
Reciprocal0.0000335886≈

Representations

Decimal29,772
Binary11101000100110015 bits
Octal72114
Hexadecimal744C
Base 36MZ0
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-nine thousand, seven hundred and seventy-two
Ordinaltwenty-nine thousand, seven hundred and seventy-second
Scientific notation2.9772 × 10^4
Engineering notation29.772 × 10^3

In other bases

Ternary1111211200base 3; the most digit-efficient integer base after e: 10 digits
Quinary1423042base 5; one hand: 7 digits
Septenary152541base 7: 6 digits
Nonary44750base 9; each digit is two ternary digits: 5 digits
Duodecimal15290base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3e8cbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:16:12base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTTT0TTT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011010001011100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0111010001001100
Bit length15 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits8within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 14worth 16,384
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes274 4c
Gray code100111001101010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0111010001001100
32-bit00000000000000000111010001001100
64-bit0000000000000000000000000000000000000000000000000111010001001100
One's complement1000101110110011at 16 bits, every bit flipped
Bits reversed0011001000101110at 16 bits
Rotated left by 11110100010011000at 16 bits, wrapping
Shifted left by 11110100010011000= 59,544, no wrap
Shifted right by 111101000100110= 14,886, discarding the low bit
These bits as a double1.47093224 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime29,789+17
Previous prime29,761−11
Distance to nearest prime11
Nearest square below29,584
Nearest square above29,929

Powers & multiples

29,772 to the power 2886,371,984
29,772 to the power 326,389,066,707,648
29,772 to the power 4785,655,294,020,096,256
29,772 to the power 523,390,529,413,566,305,733,632
First ten multiples29,772, 59,544, 89,316, 119,088, 148,860, 178,632, 208,404, 238,176, 267,948, 297,720
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 172the total stopping time
Highest value reached80,5122× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps29,772 → 14,886 → 7,443 → 22,330 → 11,165 → 33,496 → 16,748 → 8,374 → 4,187 → 12,562 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,977,200%
29,772% as a decimal297.72
29,772% of 10029,772
29,772% of 1,000297,720
As a fraction of 10029,772/100

Read another way

As bytes29.074 KiB
As a 24-bit colour#00744C

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 “29772” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.