Recognised as Number

15,283

Positive
Odd
Composite
5 digits

15,283 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value15,283

Digit count5

Digit sum19

Digit product240

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation17 × 29 × 31

Distinct prime factors317, 29, 31

Number of divisors8

Sum of divisors σ(n)17,280

Aliquot sum1,997sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,680the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 13,440

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

SquarefreeYesno repeated prime factor

All divisors1, 17, 29, 31, 493, 527, 899, 15,2838 in total

Arithmetic

Previous number15,282

Next number15,284

Double30,566

Half7,641.5

Square233,570,089

Cube3,569,651,670,187

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

Cube root24.816252787≈

Negation-15,283

Reciprocal0.0000654322≈

Representations

Decimal15,283

Binary1110111011001114 bits

Octal35663

Hexadecimal3BB3

Base 36BSJ

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

In wordsfifteen thousand, two hundred and eighty-three

Ordinalfifteen thousand, two hundred and eighty-third

Scientific notation1.5283 × 10^4

Engineering notation15.283 × 10^3

In other bases

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

Quinary442113base 5; one hand: 6 digits

Septenary62362base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011101110110011

Bit length14 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits4within that length

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

Highest set bitbit 13worth 8,192

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes23b b3

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

At each machine width

16-bit0011101110110011

32-bit00000000000000000011101110110011

64-bit0000000000000000000000000000000000000000000000000011101110110011

One's complement1100010001001100at 16 bits, every bit flipped

Bits reversed1100110111011100at 16 bits

Rotated left by 10111011101100110at 16 bits, wrapping

Shifted left by 1111011101100110= 30,566, no wrap

Shifted right by 11110111011001= 7,641, discarding the low bit

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

Nearest landmarks

Next prime15,287+4

Previous prime15,277−6

Distance to nearest prime4

Nearest square below15,129

Nearest square above15,376

Powers & multiples

15,283 to the power 2233,570,089

15,283 to the power 33,569,651,670,187

15,283 to the power 454,554,986,475,467,921

15,283 to the power 5833,763,858,304,576,236,643

First ten multiples15,283, 30,566, 45,849, 61,132, 76,415, 91,698, 106,981, 122,264, 137,547, 152,830

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9No, remainder 1

Divisible by 10No, remainder 3

Divisible by 11No, remainder 4

Divisible by 12No, remainder 7

Divisible by 100No, remainder 83

Collatz (3n + 1) trajectory

Steps to reach 132the total stopping time

Highest value reached68,7764× the starting value

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

First steps15,283 → 45,850 → 22,925 → 68,776 → 34,388 → 17,194 → 8,597 → 25,792 → 12,896 → 6,448 → …

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

As a percentage & fraction

As a percentage1,528,300%

15,283% as a decimal152.83

15,283% of 10015,283

15,283% of 1,000152,830

As a fraction of 10015,283/100

Read another way

As seconds4 hours, 14 minutes and 43 seconds

As bytes14.925 KiB

As a 24-bit colour#003BB3

Keep nerding

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