Recognised as Number

33,047

Positive
Odd
Composite
5 digits

33,047 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value33,047

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 4,721

Distinct prime factors27, 4,721

Number of divisors4

Sum of divisors σ(n)37,776

Aliquot sum4,729sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)14,160the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 28,320

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 7, 4,721, 33,0474 in total

Arithmetic

Previous number33,046

Next number33,048

Double66,094

Half16,523.5

Square1,092,104,209

Cube36,090,767,794,823

Square root181.78833846≈irrational, shown to 9 decimal places

Cube root32.090563765≈

Negation-33,047

Reciprocal0.0000302599≈

Representations

Decimal33,047

Binary100000010001011116 bits

Octal100427

Hexadecimal8117

Base 36PHZ

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

In wordsthirty-three thousand and forty-seven

Ordinalthirty-three thousand and forty-seventh

Scientific notation3.3047 × 10^4

Engineering notation33.047 × 10^3

In other bases

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

Quinary2024142base 5; one hand: 7 digits

Septenary165230base 7: 6 digits

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

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

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

Sexagesimal9:10:47base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1000000100010111

Bit length16 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits10within that length

Bit parityeven6 set bits, so even; not the same as the number itself being odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes281 17

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

At each machine width

16-bit1000000100010111

32-bit00000000000000001000000100010111

64-bit0000000000000000000000000000000000000000000000001000000100010111

One's complement0111111011101000at 16 bits, every bit flipped

Bits reversed1110100010000001at 16 bits

Rotated left by 10000001000101111at 16 bits, wrapping

Shifted left by 110000001000101110= 66,094, no wrap

Shifted right by 1100000010001011= 16,523, discarding the low bit

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

Nearest landmarks

Next prime33,049+2

Previous prime33,037−10

Distance to nearest prime2

Nearest square below32,761

Nearest square above33,124

Powers & multiples

33,047 to the power 21,092,104,209

33,047 to the power 336,090,767,794,823

33,047 to the power 41,192,691,603,315,515,681

33,047 to the power 539,414,879,414,767,846,710,007

First ten multiples33,047, 66,094, 99,141, 132,188, 165,235, 198,282, 231,329, 264,376, 297,423, 330,470

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9No, remainder 8

Divisible by 10No, remainder 7

Divisible by 11No, remainder 3

Divisible by 12No, remainder 11

Divisible by 100No, remainder 47

Collatz (3n + 1) trajectory

Steps to reach 167the total stopping time

Highest value reached223,0726× the starting value

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

First steps33,047 → 99,142 → 49,571 → 148,714 → 74,357 → 223,072 → 111,536 → 55,768 → 27,884 → 13,942 → …

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

As a percentage & fraction

As a percentage3,304,700%

33,047% as a decimal330.47

33,047% of 10033,047

33,047% of 1,000330,470

As a fraction of 10033,047/100

Read another way

As seconds9 hours, 10 minutes and 47 seconds

As bytes32.272 KiB

As a 24-bit colour#008117

Keep nerding

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