Recognised as Number

29,129

Positive
Odd
Prime
5 digits

29,129 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value29,129

Digit count5

Digit sum23

Digit product324

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation29,129

Distinct prime factors129,129

Number of divisors2

Sum of divisors σ(n)29,130

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)29,128the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 29,1292 in total

Arithmetic

Previous number29,128

Next number29,130

Double58,258

Half14,564.5

Square848,498,641

Cube24,715,916,913,689

Square root170.672200431≈irrational, shown to 9 decimal places

Cube root30.768655919≈

Negation-29,129

Reciprocal0.00003433≈

Representations

Decimal29,129

Binary11100011100100115 bits

Octal70711

Hexadecimal71C9

Base 36MH5

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

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

Ordinaltwenty-nine thousand, one hundred and twenty-ninth

Scientific notation2.9129 × 10^4

Engineering notation29.129 × 10^3

In other bases

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

Quinary1413004base 5; one hand: 7 digits

Septenary150632base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111000111001001

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

Bytes271 c9

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

At each machine width

16-bit0111000111001001

32-bit00000000000000000111000111001001

64-bit0000000000000000000000000000000000000000000000000111000111001001

One's complement1000111000110110at 16 bits, every bit flipped

Bits reversed1001001110001110at 16 bits

Rotated left by 11110001110010010at 16 bits, wrapping

Shifted left by 11110001110010010= 58,258, no wrap

Shifted right by 111100011100100= 14,564, discarding the low bit

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

Nearest landmarks

Next prime29,131+2

Previous prime29,123−6

Distance to nearest prime0, it is prime

Nearest square below28,900

Nearest square above29,241

Powers & multiples

29,129 to the power 2848,498,641

29,129 to the power 324,715,916,913,689

29,129 to the power 4719,949,943,778,846,881

29,129 to the power 520,971,421,912,334,030,796,649

First ten multiples29,129, 58,258, 87,387, 116,516, 145,645, 174,774, 203,903, 233,032, 262,161, 291,290

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 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 9

Divisible by 11No, remainder 1

Divisible by 12No, remainder 5

Divisible by 100No, remainder 29

Collatz (3n + 1) trajectory

Steps to reach 159the total stopping time

Highest value reached147,4725× the starting value

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

First steps29,129 → 87,388 → 43,694 → 21,847 → 65,542 → 32,771 → 98,314 → 49,157 → 147,472 → 73,736 → …

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

As a percentage & fraction

As a percentage2,912,900%

29,129% as a decimal291.29

29,129% of 10029,129

29,129% of 1,000291,290

As a fraction of 10029,129/100

Read another way

As seconds8 hours, 5 minutes and 29 seconds

As bytes28.446 KiB

As a 24-bit colour#0071C9

Keep nerding

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