Recognised as Number

33,974

Positive
Even
Composite
5 digits

33,974 is an even 5-digit integer and a composite number. It has 4 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value33,974

Digit count5

Digit sum26

Digit product2,268

Multiplicative persistence4times 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 factorisation2 × 16,987

Distinct prime factors22, 16,987

Number of divisors4

Sum of divisors σ(n)50,964

Aliquot sum16,990sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 16,987, 33,9744 in total

Arithmetic

Previous number33,973

Next number33,975

Double67,948

Half16,987

Square1,154,232,676

Cube39,213,900,934,424

Square root184.320373264≈irrational, shown to 9 decimal places

Cube root32.387858073≈

Negation-33,974

Reciprocal0.0000294343≈

Representations

Decimal33,974

Binary100001001011011016 bits

Octal102266

Hexadecimal84B6

Base 36Q7Q

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

In wordsthirty-three thousand, nine hundred and seventy-four

Ordinalthirty-three thousand, nine hundred and seventy-fourth

Scientific notation3.3974 × 10^4

Engineering notation33.974 × 10^3

In other bases

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

Quinary2041344base 5; one hand: 7 digits

Septenary201023base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000010010110110

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 even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes284 b6

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

At each machine width

16-bit1000010010110110

32-bit00000000000000001000010010110110

64-bit0000000000000000000000000000000000000000000000001000010010110110

One's complement0111101101001001at 16 bits, every bit flipped

Bits reversed0110110100100001at 16 bits

Rotated left by 10000100101101101at 16 bits, wrapping

Shifted left by 110000100101101100= 67,948, no wrap

Shifted right by 1100001001011011= 16,987, discarding the low bit

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

Nearest landmarks

Next prime33,997+23

Previous prime33,967−7

Distance to nearest prime7

Nearest square below33,856

Nearest square above34,225

Powers & multiples

33,974 to the power 21,154,232,676

33,974 to the power 339,213,900,934,424

33,974 to the power 41,332,253,070,346,120,976

33,974 to the power 545,261,965,811,939,114,038,624

First ten multiples33,974, 67,948, 101,922, 135,896, 169,870, 203,844, 237,818, 271,792, 305,766, 339,740

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 4

Divisible by 6No, remainder 2

Divisible by 7No, remainder 3

Divisible by 8No, remainder 6

Divisible by 9No, remainder 8

Divisible by 10No, remainder 4

Divisible by 11No, remainder 6

Divisible by 12No, remainder 2

Divisible by 100No, remainder 74

Collatz (3n + 1) trajectory

Steps to reach 1111the total stopping time

Highest value reached183,6885× the starting value

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

First steps33,974 → 16,987 → 50,962 → 25,481 → 76,444 → 38,222 → 19,111 → 57,334 → 28,667 → 86,002 → …

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

As a percentage & fraction

As a percentage3,397,400%

33,974% as a decimal339.74

33,974% of 10033,974

33,974% of 1,000339,740

As a fraction of 10033,974/100

Read another way

As seconds9 hours, 26 minutes and 14 seconds

As bytes33.178 KiB

As a 24-bit colour#0084B6

Keep nerding

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