Recognised as Number

33,767

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value33,767

Digit count5

Digit sum26

Digit product2,646

Multiplicative persistence5times 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 factorisation33,767

Distinct prime factors133,767

Number of divisors2

Sum of divisors σ(n)33,768

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)33,766the 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,7672 in total

Arithmetic

Previous number33,766

Next number33,768

Double67,534

Half16,883.5

Square1,140,210,289

Cube38,501,480,828,663

Square root183.757993023≈irrational, shown to 9 decimal places

Cube root32.321945423≈

Negation-33,767

Reciprocal0.0000296147≈

Representations

Decimal33,767

Binary100000111110011116 bits

Octal101747

Hexadecimal83E7

Base 36Q1Z

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

In wordsthirty-three thousand, seven hundred and sixty-seven

Ordinalthirty-three thousand, seven hundred and sixty-seventh

Scientific notation3.3767 × 10^4

Engineering notation33.767 × 10^3

In other bases

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

Quinary2040032base 5; one hand: 7 digits

Septenary200306base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000001111100111

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 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

Bytes283 e7

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

At each machine width

16-bit1000001111100111

32-bit00000000000000001000001111100111

64-bit0000000000000000000000000000000000000000000000001000001111100111

One's complement0111110000011000at 16 bits, every bit flipped

Bits reversed1110011111000001at 16 bits

Rotated left by 10000011111001111at 16 bits, wrapping

Shifted left by 110000011111001110= 67,534, no wrap

Shifted right by 1100000111110011= 16,883, discarding the low bit

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

Nearest landmarks

Next prime33,769+2

Previous prime33,757−10

Distance to nearest prime0, it is prime

Nearest square below33,489

Nearest square above33,856

Powers & multiples

33,767 to the power 21,140,210,289

33,767 to the power 338,501,480,828,663

33,767 to the power 41,300,079,503,141,463,521

33,767 to the power 543,899,784,582,577,798,713,607

First ten multiples33,767, 67,534, 101,301, 135,068, 168,835, 202,602, 236,369, 270,136, 303,903, 337,670

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 7No, remainder 6

Divisible by 8No, remainder 7

Divisible by 9No, remainder 8

Divisible by 10No, remainder 7

Divisible by 11No, remainder 8

Divisible by 12No, remainder 11

Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 1160the total stopping time

Highest value reached384,64011× the starting value

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

First steps33,767 → 101,302 → 50,651 → 151,954 → 75,977 → 227,932 → 113,966 → 56,983 → 170,950 → 85,475 → …

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

As a percentage & fraction

As a percentage3,376,700%

33,767% as a decimal337.67

33,767% of 10033,767

33,767% of 1,000337,670

As a fraction of 10033,767/100

Read another way

As seconds9 hours, 22 minutes and 47 seconds

As bytes32.976 KiB

As a 24-bit colour#0083E7

Keep nerding

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