Recognised as Number

15,294

Positive
Even
Composite
5 digits

15,294 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value15,294

Digit count5

Digit sum21

Digit product360

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 2,549

Distinct prime factors32, 3, 2,549

Number of divisors8

Sum of divisors σ(n)30,600

Aliquot sum15,306sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 2,549, 5,098, 7,647, 15,2948 in total

Arithmetic

Previous number15,293

Next number15,295

Double30,588

Half7,647

Square233,906,436

Cube3,577,365,032,184

Square root123.668912828≈irrational, shown to 9 decimal places

Cube root24.822205225≈

Negation-15,294

Reciprocal0.0000653851≈

Representations

Decimal15,294

Binary1110111011111014 bits

Octal35676

Hexadecimal3BBE

Base 36BSU

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

In wordsfifteen thousand, two hundred and ninety-four

Ordinalfifteen thousand, two hundred and ninety-fourth

Scientific notation1.5294 × 10^4

Engineering notation15.294 × 10^3

In other bases

Ternary202222110base 3; the most digit-efficient integer base after e: 9 digits

Quinary442134base 5; one hand: 6 digits

Septenary62406base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011101110111110

Bit length14 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits3within that length

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

Highest set bitbit 13worth 8,192

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes23b be

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

At each machine width

16-bit0011101110111110

32-bit00000000000000000011101110111110

64-bit0000000000000000000000000000000000000000000000000011101110111110

One's complement1100010001000001at 16 bits, every bit flipped

Bits reversed0111110111011100at 16 bits

Rotated left by 10111011101111100at 16 bits, wrapping

Shifted left by 1111011101111100= 30,588, no wrap

Shifted right by 11110111011111= 7,647, discarding the low bit

These bits as a double7.55623999 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime15,299+5

Previous prime15,289−5

Distance to nearest prime5

Nearest square below15,129

Nearest square above15,376

Powers & multiples

15,294 to the power 2233,906,436

15,294 to the power 33,577,365,032,184

15,294 to the power 454,712,220,802,222,096

15,294 to the power 5836,768,704,949,184,736,224

First ten multiples15,294, 30,588, 45,882, 61,176, 76,470, 91,764, 107,058, 122,352, 137,646, 152,940

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 4

Divisible by 6Yes

Divisible by 7No, remainder 6

Divisible by 8No, remainder 6

Divisible by 9No, remainder 3

Divisible by 10No, remainder 4

Divisible by 11No, remainder 4

Divisible by 12No, remainder 6

Divisible by 100No, remainder 94

Collatz (3n + 1) trajectory

Steps to reach 1177the total stopping time

Highest value reached116,1527× the starting value

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

First steps15,294 → 7,647 → 22,942 → 11,471 → 34,414 → 17,207 → 51,622 → 25,811 → 77,434 → 38,717 → …

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

As a percentage & fraction

As a percentage1,529,400%

15,294% as a decimal152.94

15,294% of 10015,294

15,294% of 1,000152,940

As a fraction of 10015,294/100

Read another way

As seconds4 hours, 14 minutes and 54 seconds

As bytes14.936 KiB

As a 24-bit colour#003BBE

Keep nerding

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