Recognised as Number

30,364

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value30,364

Digit count5

Digit sum16

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 7,591

Distinct prime factors22, 7,591

Number of divisors6

Sum of divisors σ(n)53,144

Aliquot sum22,780sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 7,591, 15,182, 30,3646 in total

Arithmetic

Previous number30,363

Next number30,365

Double60,728

Half15,182

Square921,972,496

Cube27,994,772,868,544

Square root174.25269008≈irrational, shown to 9 decimal places

Cube root31.197490484≈

Negation-30,364

Reciprocal0.0000329337≈

Representations

Decimal30,364

Binary11101101001110015 bits

Octal73234

Hexadecimal769C

Base 36NFG

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

In wordsthirty thousand, three hundred and sixty-four

Ordinalthirty thousand, three hundred and sixty-fourth

Scientific notation3.0364 × 10^4

Engineering notation30.364 × 10^3

In other bases

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

Quinary1432424base 5; one hand: 7 digits

Septenary154345base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111011010011100

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

Bytes276 9c

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

At each machine width

16-bit0111011010011100

32-bit00000000000000000111011010011100

64-bit0000000000000000000000000000000000000000000000000111011010011100

One's complement1000100101100011at 16 bits, every bit flipped

Bits reversed0011100101101110at 16 bits

Rotated left by 11110110100111000at 16 bits, wrapping

Shifted left by 11110110100111000= 60,728, no wrap

Shifted right by 111101101001110= 15,182, discarding the low bit

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

Nearest landmarks

Next prime30,367+3

Previous prime30,347−17

Distance to nearest prime3

Nearest square below30,276

Nearest square above30,625

Powers & multiples

30,364 to the power 2921,972,496

30,364 to the power 327,994,772,868,544

30,364 to the power 4850,033,283,380,470,016

30,364 to the power 525,810,410,616,564,591,565,824

First ten multiples30,364, 60,728, 91,092, 121,456, 151,820, 182,184, 212,548, 242,912, 273,276, 303,640

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6No, remainder 4

Divisible by 7No, remainder 5

Divisible by 8No, remainder 4

Divisible by 9No, remainder 7

Divisible by 10No, remainder 4

Divisible by 11No, remainder 4

Divisible by 12No, remainder 4

Divisible by 100No, remainder 64

Collatz (3n + 1) trajectory

Steps to reach 1178the total stopping time

Highest value reached57,6521× the starting value

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

First steps30,364 → 15,182 → 7,591 → 22,774 → 11,387 → 34,162 → 17,081 → 51,244 → 25,622 → 12,811 → …

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

As a percentage & fraction

As a percentage3,036,400%

30,364% as a decimal303.64

30,364% of 10030,364

30,364% of 1,000303,640

As a fraction of 10030,364/100

Read another way

As seconds8 hours, 26 minutes and 4 seconds

As bytes29.652 KiB

As a 24-bit colour#00769C

Keep nerding

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