Recognised as Number

30,164

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value30,164

Digit count5

Digit sum14

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 7,541

Distinct prime factors22, 7,541

Number of divisors6

Sum of divisors σ(n)52,794

Aliquot sum22,630sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)7,540the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 15,080

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 7,541, 15,082, 30,1646 in total

Arithmetic

Previous number30,163

Next number30,165

Double60,328

Half15,082

Square909,866,896

Cube27,445,225,050,944

Square root173.677862723≈irrational, shown to 9 decimal places

Cube root31.128842878≈

Negation-30,164

Reciprocal0.0000331521≈

Representations

Decimal30,164

Binary11101011101010015 bits

Octal72724

Hexadecimal75D4

Base 36N9W

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

In wordsthirty thousand, one hundred and sixty-four

Ordinalthirty thousand, one hundred and sixty-fourth

Scientific notation3.0164 × 10^4

Engineering notation30.164 × 10^3

In other bases

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

Quinary1431124base 5; one hand: 7 digits

Septenary153641base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111010111010100

Bit length15 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes275 d4

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

At each machine width

16-bit0111010111010100

32-bit00000000000000000111010111010100

64-bit0000000000000000000000000000000000000000000000000111010111010100

One's complement1000101000101011at 16 bits, every bit flipped

Bits reversed0010101110101110at 16 bits

Rotated left by 11110101110101000at 16 bits, wrapping

Shifted left by 11110101110101000= 60,328, no wrap

Shifted right by 111101011101010= 15,082, discarding the low bit

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

Nearest landmarks

Next prime30,169+5

Previous prime30,161−3

Distance to nearest prime3

Nearest square below29,929

Nearest square above30,276

Powers & multiples

30,164 to the power 2909,866,896

30,164 to the power 327,445,225,050,944

30,164 to the power 4827,857,768,436,674,816

30,164 to the power 524,971,501,727,123,859,149,824

First ten multiples30,164, 60,328, 90,492, 120,656, 150,820, 180,984, 211,148, 241,312, 271,476, 301,640

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6No, remainder 2

Divisible by 7No, remainder 1

Divisible by 8No, remainder 4

Divisible by 9No, remainder 5

Divisible by 10No, remainder 4

Divisible by 11No, remainder 2

Divisible by 12No, remainder 8

Divisible by 100No, remainder 64

Collatz (3n + 1) trajectory

Steps to reach 1134the total stopping time

Highest value reached30,164

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

First steps30,164 → 15,082 → 7,541 → 22,624 → 11,312 → 5,656 → 2,828 → 1,414 → 707 → 2,122 → …

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

As a percentage & fraction

As a percentage3,016,400%

30,164% as a decimal301.64

30,164% of 10030,164

30,164% of 1,000301,640

As a fraction of 10030,164/100

Read another way

As seconds8 hours, 22 minutes and 44 seconds

As bytes29.457 KiB

As a 24-bit colour#0075D4

Keep nerding

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