Nerdulator> put something in

Recognised as Number

29,721

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value29,721
Digit count5
Digit sum21
Digit product252
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 9,907
Distinct prime factors23, 9,907
Number of divisors4
Sum of divisors σ(n)39,632
Aliquot sum9,911sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)19,812integers below n that share no factor with it
Carmichael function λ(n)9,906the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 19,812
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 9,907, 29,7214 in total

Arithmetic

Previous number29,720
Next number29,722
Double59,442
Square root172.39779581≈irrational, shown to 9 decimal places
Cube root30.975700694≈
Negation-29,721
Reciprocal0.0000336462≈

Representations

Decimal29,721
Binary11101000001100115 bits
Octal72031
Hexadecimal7419
Base 36MXL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-nine thousand, seven hundred and twenty-one
Ordinaltwenty-nine thousand, seven hundred and twenty-first
Scientific notation2.9721 × 10^4
Engineering notation29.721 × 10^3

In other bases

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

Bit-level

0111010000011001
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 odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes274 19
Gray code100111000010101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0111010000011001
32-bit00000000000000000111010000011001
64-bit0000000000000000000000000000000000000000000000000111010000011001
One's complement1000101111100110at 16 bits, every bit flipped
Bits reversed1001100000101110at 16 bits
Rotated left by 11110100000110010at 16 bits, wrapping
Shifted left by 11110100000110010= 59,442, no wrap
Shifted right by 111101000001100= 14,860, discarding the low bit
These bits as a double1.46841251 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime29,723+2
Previous prime29,717−4
Distance to nearest prime2
Nearest square below29,584
Nearest square above29,929

Powers & multiples

29,721 to the power 2883,337,841
29,721 to the power 326,253,683,972,361
29,721 to the power 4780,285,741,342,541,281
29,721 to the power 523,190,872,518,441,669,412,601
First ten multiples29,721, 59,442, 89,163, 118,884, 148,605, 178,326, 208,047, 237,768, 267,489, 297,210
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1147the total stopping time
Highest value reached2,316,76077× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps29,721 → 89,164 → 44,582 → 22,291 → 66,874 → 33,437 → 100,312 → 50,156 → 25,078 → 12,539 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,972,100%
29,721% as a decimal297.21
29,721% of 10029,721
29,721% of 1,000297,210
As a fraction of 10029,721/100

Read another way

As bytes29.024 KiB
As a 24-bit colour#007419

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