Recognised as Number

29,131

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value29,131

Digit count5

Digit sum16

Digit product54

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation29,131

Distinct prime factors129,131

Number of divisors2

Sum of divisors σ(n)29,132

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)29,130the 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,1312 in total

Arithmetic

Previous number29,130

Next number29,132

Double58,262

Half14,565.5

Square848,615,161

Cube24,721,008,255,091

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

Cube root30.769360096≈

Negation-29,131

Reciprocal0.0000343277≈

Representations

Decimal29,131

Binary11100011100101115 bits

Octal70713

Hexadecimal71CB

Base 36MH7

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

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

Ordinaltwenty-nine thousand, one hundred and thirty-first

Scientific notation2.9131 × 10^4

Engineering notation29.131 × 10^3

In other bases

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

Quinary1413011base 5; one hand: 7 digits

Septenary150634base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111000111001011

Bit length15 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits6within that length

Bit parityodd9 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

Bytes271 cb

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

At each machine width

16-bit0111000111001011

32-bit00000000000000000111000111001011

64-bit0000000000000000000000000000000000000000000000000111000111001011

One's complement1000111000110100at 16 bits, every bit flipped

Bits reversed1101001110001110at 16 bits

Rotated left by 11110001110010110at 16 bits, wrapping

Shifted left by 11110001110010110= 58,262, no wrap

Shifted right by 111100011100101= 14,565, discarding the low bit

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

Nearest landmarks

Next prime29,137+6

Previous prime29,129−2

Distance to nearest prime0, it is prime

Nearest square below28,900

Nearest square above29,241

Powers & multiples

29,131 to the power 2848,615,161

29,131 to the power 324,721,008,255,091

29,131 to the power 4720,147,691,479,055,921

29,131 to the power 520,978,622,400,476,378,034,651

First ten multiples29,131, 58,262, 87,393, 116,524, 145,655, 174,786, 203,917, 233,048, 262,179, 291,310

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 3

Divisible by 9No, remainder 7

Divisible by 10No, remainder 1

Divisible by 11No, remainder 3

Divisible by 12No, remainder 7

Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 159the total stopping time

Highest value reached131,0924× the starting value

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

First steps29,131 → 87,394 → 43,697 → 131,092 → 65,546 → 32,773 → 98,320 → 49,160 → 24,580 → 12,290 → …

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

As a percentage & fraction

As a percentage2,913,100%

29,131% as a decimal291.31

29,131% of 10029,131

29,131% of 1,000291,310

As a fraction of 10029,131/100

Read another way

As seconds8 hours, 5 minutes and 31 seconds

As bytes28.448 KiB

As a 24-bit colour#0071CB

Keep nerding

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