Number

29,421

Positive
Odd
Composite
5 digits

29,421 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value29,421

Digit count5

Digit sum18

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 7 × 467

Distinct prime factors33, 7, 467

Number of divisors12

Sum of divisors σ(n)48,672

Aliquot sum19,251sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 7, 9, 21, 63, 467, 1,401, 3,269, 4,203, 9,807, 29,42112 in total

Arithmetic

Previous number29,420

Next number29,422

Double58,842

Half14,710.5

Square865,595,241

Cube25,466,677,585,461

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

Cube root30.871126452≈

Negation-29,421

Reciprocal0.0000339893≈

Representations

Decimal29,421

Binary11100101110110115 bits

Octal71355

Hexadecimal72ED

Base 36MP9

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

In wordstwenty-nine thousand, four hundred and twenty-one

Ordinaltwenty-nine thousand, four hundred and twenty-first

Scientific notation2.9421 × 10^4

Engineering notation29.421 × 10^3

Nearest landmarks

Next prime29,423+2

Previous prime29,411−10

Distance to nearest prime2

Nearest square below29,241

Nearest square above29,584

Powers & multiples

29,421 to the power 2865,595,241

29,421 to the power 325,466,677,585,461

29,421 to the power 4749,255,121,241,848,081

29,421 to the power 522,043,834,922,056,412,391,101

First ten multiples29,421, 58,842, 88,263, 117,684, 147,105, 176,526, 205,947, 235,368, 264,789, 294,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 7Yes

Divisible by 8No, remainder 5

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 7

Divisible by 12No, remainder 9

Divisible by 100No, remainder 21

Collatz (3n + 1) trajectory

Steps to reach 1103the total stopping time

Highest value reached88,2643× the starting value

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

First steps29,421 → 88,264 → 44,132 → 22,066 → 11,033 → 33,100 → 16,550 → 8,275 → 24,826 → 12,413 → …

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

As a percentage & fraction

As a percentage2,942,100%

29,421% as a decimal294.21

29,421% of 10029,421

29,421% of 1,000294,210

As a fraction of 10029,421/100

Read another way

As seconds8 hours, 10 minutes and 21 seconds

As bytes28.731 KiB

As a 24-bit colour#0072ED

Keep nerding

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