Nerdulator> put something in

Recognised as Number

15,275

  • Positive
  • Odd
  • Composite
  • 5 digits

15,275 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value15,275
Digit count5
Digit sum20
Digit product350
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5^2 × 13 × 47
Distinct prime factors35, 13, 47
Number of divisors12
Sum of divisors σ(n)20,832
Aliquot sum5,557sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)11,040integers below n that share no factor with it
Carmichael function λ(n)1,380the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 11,040
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 13, 25, 47, 65, 235, 325, 611, 1,175, 3,055, 15,27512 in total

Arithmetic

Previous number15,274
Next number15,276
Double30,550
Square root123.592070943≈irrational, shown to 9 decimal places
Cube root24.811921947≈
Negation-15,275
Reciprocal0.0000654664≈

Representations

Decimal15,275
Binary1110111010101114 bits
Octal35653
Hexadecimal3BAB
Base 36BSB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifteen thousand, two hundred and seventy-five
Ordinalfifteen thousand, two hundred and seventy-fifth
Scientific notation1.5275 × 10^4
Engineering notation15.275 × 10^3

In other bases

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

Bit-level

0011101110101011
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 ab
Gray code10011001111110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011101110101011
32-bit00000000000000000011101110101011
64-bit0000000000000000000000000000000000000000000000000011101110101011
One's complement1100010001010100at 16 bits, every bit flipped
Bits reversed1101010111011100at 16 bits
Rotated left by 10111011101010110at 16 bits, wrapping
Shifted left by 1111011101010110= 30,550, no wrap
Shifted right by 11110111010101= 7,637, discarding the low bit
These bits as a double7.54685274 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime15,277+2
Previous prime15,271−4
Distance to nearest prime2
Nearest square below15,129
Nearest square above15,376

Powers & multiples

15,275 to the power 2233,325,625
15,275 to the power 33,564,048,921,875
15,275 to the power 454,440,847,281,640,625
15,275 to the power 5831,583,942,227,060,546,875
First ten multiples15,275, 30,550, 45,825, 61,100, 76,375, 91,650, 106,925, 122,200, 137,475, 152,750
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 184the total stopping time
Highest value reached69,7124× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps15,275 → 45,826 → 22,913 → 68,740 → 34,370 → 17,185 → 51,556 → 25,778 → 12,889 → 38,668 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,527,500%
15,275% as a decimal152.75
15,275% of 10015,275
15,275% of 1,000152,750
As a fraction of 10015,275/100

Read another way

As bytes14.917 KiB
As a 24-bit colour#003BAB

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 “15275” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.