Nerdulator> put something in

Recognised as Number

15,276

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value15,276
Digit count5
Digit sum21
Digit product420
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^2 × 3 × 19 × 67
Distinct prime factors42, 3, 19, 67
Number of divisors24
Sum of divisors σ(n)38,080
Aliquot sum22,804sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)4,752integers below n that share no factor with it
Carmichael function λ(n)198the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,752
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 12, 19, 38, 57, 67, 76, 114, 134, 201, 228, 268, 402, 804, 1,273, 2,546, 3,819, 5,092, 7,638, 15,27624 in total

Arithmetic

Previous number15,275
Next number15,277
Double30,552
Half7,638
Square root123.596116444≈irrational, shown to 9 decimal places
Cube root24.812463385≈
Negation-15,276
Reciprocal0.0000654622≈

Representations

Decimal15,276
Binary1110111010110014 bits
Octal35654
Hexadecimal3BAC
Base 36BSC
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifteen thousand, two hundred and seventy-six
Ordinalfifteen thousand, two hundred and seventy-sixth
Scientific notation1.5276 × 10^4
Engineering notation15.276 × 10^3

In other bases

Ternary202221210base 3; the most digit-efficient integer base after e: 9 digits
Quinary442101base 5; one hand: 6 digits
Septenary62352base 7: 5 digits
Nonary22853base 9; each digit is two ternary digits: 5 digits
Duodecimal8a10base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1i3gbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:14:36base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T1000TT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100110011111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011101110101100
Bit length14 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits5within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 13worth 8,192
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes23b ac
Gray code10011001111010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011101110101100
32-bit00000000000000000011101110101100
64-bit0000000000000000000000000000000000000000000000000011101110101100
One's complement1100010001010011at 16 bits, every bit flipped
Bits reversed0011010111011100at 16 bits
Rotated left by 10111011101011000at 16 bits, wrapping
Shifted left by 1111011101011000= 30,552, no wrap
Shifted right by 11110111010110= 7,638, discarding the low bit
These bits as a double7.54734681 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime15,277+1
Previous prime15,271−5
Distance to nearest prime1
Nearest square below15,129
Nearest square above15,376

Powers & multiples

15,276 to the power 2233,356,176
15,276 to the power 33,564,748,944,576
15,276 to the power 454,455,104,877,342,976
15,276 to the power 5831,856,182,106,291,301,376
First ten multiples15,276, 30,552, 45,828, 61,104, 76,380, 91,656, 106,932, 122,208, 137,484, 152,760
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9No, remainder 3
Divisible by 10No, remainder 6
Divisible by 11No, remainder 8
Divisible by 12Yes
Divisible by 100No, remainder 76

Collatz (3n + 1) trajectory

Steps to reach 132the total stopping time
Highest value reached21,7601× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps15,276 → 7,638 → 3,819 → 11,458 → 5,729 → 17,188 → 8,594 → 4,297 → 12,892 → 6,446 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,527,600%
15,276% as a decimal152.76
15,276% of 10015,276
15,276% of 1,000152,760
As a fraction of 10015,276/100

Read another way

As bytes14.918 KiB
As a 24-bit colour#003BAC

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “15276” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.