Recognised as Number
-29,073
- Negative
- Odd
- 5 digits
-29,073 is an odd 5-digit integer and the negative of 29,073. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value29,073
Digit count5
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 11 × 881
Distinct prime factors33, 11, 881
Number of divisors8
Sum of divisors σ(n)42,336
SquarefreeYesno repeated prime factor
All divisors1, 3, 11, 33, 881, 2,643, 9,691, 29,0738 in total
Arithmetic
Representations
Decimal-29,073
Binary11100011001000115 bits
Octal70621
Hexadecimal7191
Base 36MFL
In wordsminus twenty-nine thousand and seventy-three
Ordinalminus twenty-nine thousand and seventy-third
Scientific notation-2.9073 × 10^4
Engineering notation-29.073 × 10^3
In other bases
Ternary1110212210base 3; the most digit-efficient integer base after e: 10 digits
Quinary1412243base 5; one hand: 7 digits
Septenary150522base 7: 6 digits
Nonary43783base 9; each digit is two ternary digits: 5 digits
Duodecimal149a9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3cddbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:4:33base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTTTT0101T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001001110110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000111001101111
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
Bytes271 91
Gray code100100101011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000111001101111two's complement
32-bit11111111111111111000111001101111two's complement
64-bit1111111111111111111111111111111111111111111111111000111001101111two's complement
One's complement0111000110010000at 16 bits, every bit flipped
Bits reversed1111011001110001at 16 bits
Rotated left by 10001110011011111at 16 bits, wrapping
Shifted left by 1-1110001100100010= -58,146, no wrap
Shifted right by 1-11100011001001= -14,536, discarding the low bit
These bits as a double1.43639705 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-29,073 to the power 2845,239,329
-29,073 to the power 3-24,573,643,012,017
-29,073 to the power 4714,429,523,288,370,241
-29,073 to the power 5-20,770,609,530,562,788,016,593
First ten multiples-29,073, -58,146, -87,219, -116,292, -145,365, -174,438, -203,511, -232,584, -261,657, -290,730
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 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11Yes
Divisible by 12No, remainder 9
Divisible by 100No, remainder 73
As a percentage & fraction
As a percentage-2,907,300%
-29,073% as a decimal-290.73
-29,073% of 100-29,073
-29,073% of 1,000-290,730
As a fraction of 100-29,073/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -29,073
Nerdulate something else
Nothing in mind? Surprise me · today’s page