Recognised as Number

15,354

Positive
Even
Composite
5 digits

15,354 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value15,354

Digit count5

Digit sum18

Digit product300

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3^2 × 853

Distinct prime factors32, 3, 853

Number of divisors12

Sum of divisors σ(n)33,306

Aliquot sum17,952sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 6, 9, 18, 853, 1,706, 2,559, 5,118, 7,677, 15,35412 in total

Arithmetic

Previous number15,353

Next number15,355

Double30,708

Half7,677

Square235,745,316

Cube3,619,633,581,864

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

Cube root24.854622926≈

Negation-15,354

Reciprocal0.0000651296≈

Representations

Decimal15,354

Binary1110111111101014 bits

Octal35772

Hexadecimal3BFA

Base 36BUI

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

In wordsfifteen thousand, three hundred and fifty-four

Ordinalfifteen thousand, three hundred and fifty-fourth

Scientific notation1.5354 × 10^4

Engineering notation15.354 × 10^3

In other bases

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

Quinary442404base 5; one hand: 6 digits

Septenary62523base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011101111111010

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 fa

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

At each machine width

16-bit0011101111111010

32-bit00000000000000000011101111111010

64-bit0000000000000000000000000000000000000000000000000011101111111010

One's complement1100010000000101at 16 bits, every bit flipped

Bits reversed0101111111011100at 16 bits

Rotated left by 10111011111110100at 16 bits, wrapping

Shifted left by 1111011111110100= 30,708, no wrap

Shifted right by 11110111111101= 7,677, discarding the low bit

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

Nearest landmarks

Next prime15,359+5

Previous prime15,349−5

Distance to nearest prime5

Nearest square below15,129

Nearest square above15,376

Powers & multiples

15,354 to the power 2235,745,316

15,354 to the power 33,619,633,581,864

15,354 to the power 455,575,854,015,939,856

15,354 to the power 5853,311,662,560,740,549,024

First ten multiples15,354, 30,708, 46,062, 61,416, 76,770, 92,124, 107,478, 122,832, 138,186, 153,540

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 3

Divisible by 8No, remainder 2

Divisible by 9Yes

Divisible by 10No, remainder 4

Divisible by 11No, remainder 9

Divisible by 12No, remainder 6

Divisible by 100No, remainder 54

Collatz (3n + 1) trajectory

Steps to reach 1133the total stopping time

Highest value reached65,6084× the starting value

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

First steps15,354 → 7,677 → 23,032 → 11,516 → 5,758 → 2,879 → 8,638 → 4,319 → 12,958 → 6,479 → …

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

As a percentage & fraction

As a percentage1,535,400%

15,354% as a decimal153.54

15,354% of 10015,354

15,354% of 1,000153,540

As a fraction of 10015,354/100

Read another way

As seconds4 hours, 15 minutes and 54 seconds

As bytes14.994 KiB

As a 24-bit colour#003BFA

Keep nerding

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