Recognised as Number

33,113

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value33,113

Digit count5

Digit sum11

Digit product27

Multiplicative persistence3times 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 factorisation33,113

Distinct prime factors133,113

Number of divisors2

Sum of divisors σ(n)33,114

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)33,112the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 33,1132 in total

Arithmetic

Previous number33,112

Next number33,114

Double66,226

Half16,556.5

Square1,096,470,769

Cube36,307,436,573,897

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

Cube root32.111912841≈

Negation-33,113

Reciprocal0.0000301996≈

Representations

Decimal33,113

Binary100000010101100116 bits

Octal100531

Hexadecimal8159

Base 36PJT

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

In wordsthirty-three thousand, one hundred and thirteen

Ordinalthirty-three thousand, one hundred and thirteenth

Scientific notation3.3113 × 10^4

Engineering notation33.113 × 10^3

In other bases

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

Quinary2024423base 5; one hand: 7 digits

Septenary165353base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000000101011001

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 59

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

At each machine width

16-bit1000000101011001

32-bit00000000000000001000000101011001

64-bit0000000000000000000000000000000000000000000000001000000101011001

One's complement0111111010100110at 16 bits, every bit flipped

Bits reversed1001101010000001at 16 bits

Rotated left by 10000001010110011at 16 bits, wrapping

Shifted left by 110000001010110010= 66,226, no wrap

Shifted right by 1100000010101100= 16,556, discarding the low bit

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

Nearest landmarks

Next prime33,119+6

Previous prime33,107−6

Distance to nearest prime0, it is prime

Nearest square below32,761

Nearest square above33,124

Powers & multiples

33,113 to the power 21,096,470,769

33,113 to the power 336,307,436,573,897

33,113 to the power 41,202,248,147,271,451,361

33,113 to the power 539,810,042,900,599,568,916,793

First ten multiples33,113, 66,226, 99,339, 132,452, 165,565, 198,678, 231,791, 264,904, 298,017, 331,130

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 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 2

Divisible by 10No, remainder 3

Divisible by 11No, remainder 3

Divisible by 12No, remainder 5

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1116the total stopping time

Highest value reached111,7603× the starting value

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

First steps33,113 → 99,340 → 49,670 → 24,835 → 74,506 → 37,253 → 111,760 → 55,880 → 27,940 → 13,970 → …

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

As a percentage & fraction

As a percentage3,311,300%

33,113% as a decimal331.13

33,113% of 10033,113

33,113% of 1,000331,130

As a fraction of 10033,113/100

Read another way

As seconds9 hours, 11 minutes and 53 seconds

As bytes32.337 KiB

As a 24-bit colour#008159

Keep nerding

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