Recognised as Number

33,769

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value33,769

Digit count5

Digit sum28

Digit product3,402

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation33,769

Distinct prime factors133,769

Number of divisors2

Sum of divisors σ(n)33,770

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number33,768

Next number33,770

Double67,538

Half16,884.5

Square1,140,345,361

Cube38,508,322,495,609

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

Cube root32.322583548≈

Negation-33,769

Reciprocal0.000029613≈

Representations

Decimal33,769

Binary100000111110100116 bits

Octal101751

Hexadecimal83E9

Base 36Q21

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

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

Ordinalthirty-three thousand, seven hundred and sixty-ninth

Scientific notation3.3769 × 10^4

Engineering notation33.769 × 10^3

In other bases

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

Quinary2040034base 5; one hand: 7 digits

Septenary200311base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000001111101001

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

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

Bytes283 e9

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

At each machine width

16-bit1000001111101001

32-bit00000000000000001000001111101001

64-bit0000000000000000000000000000000000000000000000001000001111101001

One's complement0111110000010110at 16 bits, every bit flipped

Bits reversed1001011111000001at 16 bits

Rotated left by 10000011111010011at 16 bits, wrapping

Shifted left by 110000011111010010= 67,538, no wrap

Shifted right by 1100000111110100= 16,884, discarding the low bit

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

Nearest landmarks

Next prime33,773+4

Previous prime33,767−2

Distance to nearest prime0, it is prime

Nearest square below33,489

Nearest square above33,856

Powers & multiples

33,769 to the power 21,140,345,361

33,769 to the power 338,508,322,495,609

33,769 to the power 41,300,387,542,354,220,321

33,769 to the power 543,912,786,917,759,666,019,849

First ten multiples33,769, 67,538, 101,307, 135,076, 168,845, 202,614, 236,383, 270,152, 303,921, 337,690

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 9

Divisible by 11No, remainder 10

Divisible by 12No, remainder 1

Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 1191the total stopping time

Highest value reached2,079,59261× the starting value

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

First steps33,769 → 101,308 → 50,654 → 25,327 → 75,982 → 37,991 → 113,974 → 56,987 → 170,962 → 85,481 → …

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

As a percentage & fraction

As a percentage3,376,900%

33,769% as a decimal337.69

33,769% of 10033,769

33,769% of 1,000337,690

As a fraction of 10033,769/100

Read another way

As seconds9 hours, 22 minutes and 49 seconds

As bytes32.978 KiB

As a 24-bit colour#0083E9

Keep nerding

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