Recognised as Number

29,007

Positive
Odd
Composite
5 digits

29,007 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,007

Digit count5

Digit sum18

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation3^2 × 11 × 293

Distinct prime factors33, 11, 293

Number of divisors12

Sum of divisors σ(n)45,864

Aliquot sum16,857sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)4,380the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 17,520

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 11, 33, 99, 293, 879, 2,637, 3,223, 9,669, 29,00712 in total

Arithmetic

Previous number29,006

Next number29,008

Double58,014

Half14,503.5

Square841,406,049

Cube24,406,665,263,343

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

Cube root30.725640037≈

Negation-29,007

Reciprocal0.0000344744≈

Representations

Decimal29,007

Binary11100010100111115 bits

Octal70517

Hexadecimal714F

Base 36MDR

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

In wordstwenty-nine thousand and seven

Ordinaltwenty-nine thousand and seventh

Scientific notation2.9007 × 10^4

Engineering notation29.007 × 10^3

In other bases

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

Quinary1412012base 5; one hand: 7 digits

Septenary150366base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111000101001111

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 4f

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

At each machine width

16-bit0111000101001111

32-bit00000000000000000111000101001111

64-bit0000000000000000000000000000000000000000000000000111000101001111

One's complement1000111010110000at 16 bits, every bit flipped

Bits reversed1111001010001110at 16 bits

Rotated left by 11110001010011110at 16 bits, wrapping

Shifted left by 11110001010011110= 58,014, no wrap

Shifted right by 111100010100111= 14,503, discarding the low bit

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

Nearest landmarks

Next prime29,009+2

Previous prime28,979−28

Distance to nearest prime2

Nearest square below28,900

Nearest square above29,241

Powers & multiples

29,007 to the power 2841,406,049

29,007 to the power 324,406,665,263,343

29,007 to the power 4707,964,139,293,790,401

29,007 to the power 520,535,915,788,494,978,161,807

First ten multiples29,007, 58,014, 87,021, 116,028, 145,035, 174,042, 203,049, 232,056, 261,063, 290,070

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 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 6

Divisible by 8No, remainder 7

Divisible by 9Yes

Divisible by 10No, remainder 7

Divisible by 11Yes

Divisible by 12No, remainder 3

Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 1165the total stopping time

Highest value reached293,70410× the starting value

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

First steps29,007 → 87,022 → 43,511 → 130,534 → 65,267 → 195,802 → 97,901 → 293,704 → 146,852 → 73,426 → …

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

As a percentage & fraction

As a percentage2,900,700%

29,007% as a decimal290.07

29,007% of 10029,007

29,007% of 1,000290,070

As a fraction of 10029,007/100

Read another way

As seconds8 hours, 3 minutes and 27 seconds

As bytes28.327 KiB

As a 24-bit colour#00714F

Keep nerding

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