Recognised as Number

15,727

Positive
Odd
Prime
5 digits

15,727 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value15,727

Digit count5

Digit sum22

Digit product490

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation15,727

Distinct prime factors115,727

Number of divisors2

Sum of divisors σ(n)15,728

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)15,726the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 15,7272 in total

Arithmetic

Previous number15,726

Next number15,728

Double31,454

Half7,863.5

Square247,338,529

Cube3,889,893,045,583

Square root125.407336309≈irrational, shown to 9 decimal places

Cube root25.054282053≈

Negation-15,727

Reciprocal0.0000635849≈

Representations

Decimal15,727

Binary1111010110111114 bits

Octal36557

Hexadecimal3D6F

Base 36C4V

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

In wordsfifteen thousand, seven hundred and twenty-seven

Ordinalfifteen thousand, seven hundred and twenty-seventh

Scientific notation1.5727 × 10^4

Engineering notation15.727 × 10^3

In other bases

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

Quinary1000402base 5; one hand: 7 digits

Septenary63565base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011110101101111

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 odd

Highest set bitbit 13worth 8,192

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes23d 6f

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

At each machine width

16-bit0011110101101111

32-bit00000000000000000011110101101111

64-bit0000000000000000000000000000000000000000000000000011110101101111

One's complement1100001010010000at 16 bits, every bit flipped

Bits reversed1111011010111100at 16 bits

Rotated left by 10111101011011110at 16 bits, wrapping

Shifted left by 1111101011011110= 31,454, no wrap

Shifted right by 11111010110111= 7,863, discarding the low bit

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

Nearest landmarks

Next prime15,731+4

Previous prime15,683−44

Distance to nearest prime0, it is prime

Nearest square below15,625

Nearest square above15,876

Powers & multiples

15,727 to the power 2247,338,529

15,727 to the power 33,889,893,045,583

15,727 to the power 461,176,347,927,883,841

15,727 to the power 5962,120,423,861,829,167,407

First ten multiples15,727, 31,454, 47,181, 62,908, 78,635, 94,362, 110,089, 125,816, 141,543, 157,270

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 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 7

Divisible by 11No, remainder 8

Divisible by 12No, remainder 7

Divisible by 100No, remainder 27

Collatz (3n + 1) trajectory

Steps to reach 184the total stopping time

Highest value reached179,15211× the starting value

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

First steps15,727 → 47,182 → 23,591 → 70,774 → 35,387 → 106,162 → 53,081 → 159,244 → 79,622 → 39,811 → …

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

As a percentage & fraction

As a percentage1,572,700%

15,727% as a decimal157.27

15,727% of 10015,727

15,727% of 1,000157,270

As a fraction of 10015,727/100

Read another way

As seconds4 hours, 22 minutes and 7 seconds

As bytes15.358 KiB

As a 24-bit colour#003D6F

Keep nerding

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