Recognised as Number

30,674

Positive
Even
Composite
5 digits

30,674 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value30,674

Digit count5

Digit sum20

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 factorisation2 × 7^2 × 313

Distinct prime factors32, 7, 313

Number of divisors12

Sum of divisors σ(n)53,694

Aliquot sum23,020sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,184the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 13,104

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 7, 14, 49, 98, 313, 626, 2,191, 4,382, 15,337, 30,67412 in total

Arithmetic

Previous number30,673

Next number30,675

Double61,348

Half15,337

Square940,894,276

Cube28,860,991,022,024

Square root175.139944045≈irrational, shown to 9 decimal places

Cube root31.303301036≈

Negation-30,674

Reciprocal0.0000326009≈

Representations

Decimal30,674

Binary11101111101001015 bits

Octal73722

Hexadecimal77D2

Base 36NO2

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

In wordsthirty thousand, six hundred and seventy-four

Ordinalthirty thousand, six hundred and seventy-fourth

Scientific notation3.0674 × 10^4

Engineering notation30.674 × 10^3

In other bases

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

Quinary1440144base 5; one hand: 7 digits

Septenary155300base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111011111010010

Bit length15 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits5within that length

Bit parityeven10 set bits, so even; not the same as the number itself being even

Highest set bitbit 14worth 16,384

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes277 d2

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

At each machine width

16-bit0111011111010010

32-bit00000000000000000111011111010010

64-bit0000000000000000000000000000000000000000000000000111011111010010

One's complement1000100000101101at 16 bits, every bit flipped

Bits reversed0100101111101110at 16 bits

Rotated left by 11110111110100100at 16 bits, wrapping

Shifted left by 11110111110100100= 61,348, no wrap

Shifted right by 111101111101001= 15,337, discarding the low bit

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

Nearest landmarks

Next prime30,677+3

Previous prime30,671−3

Distance to nearest prime3

Nearest square below30,625

Nearest square above30,976

Powers & multiples

30,674 to the power 2940,894,276

30,674 to the power 328,860,991,022,024

30,674 to the power 4885,282,038,609,564,176

30,674 to the power 527,155,141,252,309,771,534,624

First ten multiples30,674, 61,348, 92,022, 122,696, 153,370, 184,044, 214,718, 245,392, 276,066, 306,740

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

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 7Yes

Divisible by 8No, remainder 2

Divisible by 9No, remainder 2

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 1240the total stopping time

Highest value reached1,119,47236× the starting value

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

First steps30,674 → 15,337 → 46,012 → 23,006 → 11,503 → 34,510 → 17,255 → 51,766 → 25,883 → 77,650 → …

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

As a percentage & fraction

As a percentage3,067,400%

30,674% as a decimal306.74

30,674% of 10030,674

30,674% of 1,000306,740

As a fraction of 10030,674/100

Read another way

As seconds8 hours, 31 minutes and 14 seconds

As bytes29.955 KiB

As a 24-bit colour#0077D2

Keep nerding

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