Recognised as Number

33,045

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value33,045

Digit count5

Digit sum15

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5 × 2,203

Distinct prime factors33, 5, 2,203

Number of divisors8

Sum of divisors σ(n)52,896

Aliquot sum19,851sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 5, 15, 2,203, 6,609, 11,015, 33,0458 in total

Arithmetic

Previous number33,044

Next number33,046

Double66,090

Half16,522.5

Square1,091,972,025

Cube36,084,215,566,125

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

Cube root32.089916379≈

Negation-33,045

Reciprocal0.0000302618≈

Representations

Decimal33,045

Binary100000010001010116 bits

Octal100425

Hexadecimal8115

Base 36PHX

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

In wordsthirty-three thousand and forty-five

Ordinalthirty-three thousand and forty-fifth

Scientific notation3.3045 × 10^4

Engineering notation33.045 × 10^3

In other bases

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

Quinary2024140base 5; one hand: 7 digits

Septenary165225base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000000100010101

Bit length16 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits11within that length

Bit parityodd5 set bits, so odd; 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 15

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

At each machine width

16-bit1000000100010101

32-bit00000000000000001000000100010101

64-bit0000000000000000000000000000000000000000000000001000000100010101

One's complement0111111011101010at 16 bits, every bit flipped

Bits reversed1010100010000001at 16 bits

Rotated left by 10000001000101011at 16 bits, wrapping

Shifted left by 110000001000101010= 66,090, no wrap

Shifted right by 1100000010001010= 16,522, discarding the low bit

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

Nearest landmarks

Next prime33,049+4

Previous prime33,037−8

Distance to nearest prime4

Nearest square below32,761

Nearest square above33,124

Powers & multiples

33,045 to the power 21,091,972,025

33,045 to the power 336,084,215,566,125

33,045 to the power 41,192,402,903,382,600,625

33,045 to the power 539,402,953,942,278,037,653,125

First ten multiples33,045, 66,090, 99,135, 132,180, 165,225, 198,270, 231,315, 264,360, 297,405, 330,450

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 6

Divisible by 10No, remainder 5

Divisible by 11No, remainder 1

Divisible by 12No, remainder 9

Divisible by 100No, remainder 45

Collatz (3n + 1) trajectory

Steps to reach 1129the total stopping time

Highest value reached99,1363× the starting value

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

First steps33,045 → 99,136 → 49,568 → 24,784 → 12,392 → 6,196 → 3,098 → 1,549 → 4,648 → 2,324 → …

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

As a percentage & fraction

As a percentage3,304,500%

33,045% as a decimal330.45

33,045% of 10033,045

33,045% of 1,000330,450

As a fraction of 10033,045/100

Read another way

As seconds9 hours, 10 minutes and 45 seconds

As bytes32.271 KiB

As a 24-bit colour#008115

Keep nerding

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