Nerdulator> put something in

Recognised as Number

33,005

  • Positive
  • Odd
  • Composite
  • 5 digits

33,005 is an odd 5-digit integer and a composite number. It has 16 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value33,005
Digit count5
Digit sum11
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 7 × 23 × 41
Distinct prime factors45, 7, 23, 41
Number of divisors16
Sum of divisors σ(n)48,384
Aliquot sum15,379sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)21,120integers below n that share no factor with it
Carmichael function λ(n)1,320the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,120
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 7, 23, 35, 41, 115, 161, 205, 287, 805, 943, 1,435, 4,715, 6,601, 33,00516 in total

Arithmetic

Previous number33,004
Next number33,006
Double66,010
Square root181.672782772≈irrational, shown to 9 decimal places
Cube root32.076963185≈
Negation-33,005
Reciprocal0.0000302984≈

Representations

Decimal33,005
Binary100000001110110116 bits
Octal100355
Hexadecimal80ED
Base 36PGT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-three thousand and five
Ordinalthirty-three thousand and fifth
Scientific notation3.3005 × 10^4
Engineering notation33.005 × 10^3

In other bases

Ternary1200021102base 3; the most digit-efficient integer base after e: 10 digits
Quinary2024010base 5; one hand: 7 digits
Septenary165140base 7: 6 digits
Nonary50242base 9; each digit is two ternary digits: 5 digits
Duodecimal17125base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal42a5base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal9:10:5base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT001T111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000100111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1000000011101101
Bit length16 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits9within that length
Bit parityodd7 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
Bytes280 ed
Gray code1100000010011011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1000000011101101
32-bit00000000000000001000000011101101
64-bit0000000000000000000000000000000000000000000000001000000011101101
One's complement0111111100010010at 16 bits, every bit flipped
Bits reversed1011011100000001at 16 bits
Rotated left by 10000000111011011at 16 bits, wrapping
Shifted left by 110000000111011010= 66,010, no wrap
Shifted right by 1100000001110110= 16,502, discarding the low bit
These bits as a double1.63066366 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime33,013+8
Previous prime32,999−6
Distance to nearest prime6
Nearest square below32,761
Nearest square above33,124

Powers & multiples

33,005 to the power 21,089,330,025
33,005 to the power 335,953,337,475,125
33,005 to the power 41,186,639,903,366,500,625
33,005 to the power 539,165,050,010,611,353,128,125
First ten multiples33,005, 66,010, 99,015, 132,020, 165,025, 198,030, 231,035, 264,040, 297,045, 330,050
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 1
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 5
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 5

Collatz (3n + 1) trajectory

Steps to reach 167the total stopping time
Highest value reached99,0163× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps33,005 → 99,016 → 49,508 → 24,754 → 12,377 → 37,132 → 18,566 → 9,283 → 27,850 → 13,925 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,300,500%
33,005% as a decimal330.05
33,005% of 10033,005
33,005% of 1,000330,050
As a fraction of 10033,005/100

Read another way

As bytes32.231 KiB
As a 24-bit colour#0080ED

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “33005” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.