Recognised as Number

15,722

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value15,722

Digit count5

Digit sum17

Digit product140

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 7 × 1,123

Distinct prime factors32, 7, 1,123

Number of divisors8

Sum of divisors σ(n)26,976

Aliquot sum11,254sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,122the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,732

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 7, 14, 1,123, 2,246, 7,861, 15,7228 in total

Arithmetic

Previous number15,721

Next number15,723

Double31,444

Half7,861

Square247,181,284

Cube3,886,184,147,048

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

Cube root25.051626648≈

Negation-15,722

Reciprocal0.0000636051≈

Representations

Decimal15,722

Binary1111010110101014 bits

Octal36552

Hexadecimal3D6A

Base 36C4Q

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

In wordsfifteen thousand, seven hundred and twenty-two

Ordinalfifteen thousand, seven hundred and twenty-second

Scientific notation1.5722 × 10^4

Engineering notation15.722 × 10^3

In other bases

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

Quinary1000342base 5; one hand: 7 digits

Septenary63560base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011110101101010

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 11 trailing zero

Power of twoNo

Bytes23d 6a

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

At each machine width

16-bit0011110101101010

32-bit00000000000000000011110101101010

64-bit0000000000000000000000000000000000000000000000000011110101101010

One's complement1100001010010101at 16 bits, every bit flipped

Bits reversed0101011010111100at 16 bits

Rotated left by 10111101011010100at 16 bits, wrapping

Shifted left by 1111101011010100= 31,444, no wrap

Shifted right by 11111010110101= 7,861, discarding the low bit

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

Nearest landmarks

Next prime15,727+5

Previous prime15,683−39

Distance to nearest prime5

Nearest square below15,625

Nearest square above15,876

Powers & multiples

15,722 to the power 2247,181,284

15,722 to the power 33,886,184,147,048

15,722 to the power 461,098,587,159,888,656

15,722 to the power 5960,591,987,327,769,449,632

First ten multiples15,722, 31,444, 47,166, 62,888, 78,610, 94,332, 110,054, 125,776, 141,498, 157,220

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7Yes

Divisible by 8No, remainder 2

Divisible by 9No, remainder 8

Divisible by 10No, remainder 2

Divisible by 11No, remainder 3

Divisible by 12No, remainder 2

Divisible by 100No, remainder 22

Collatz (3n + 1) trajectory

Steps to reach 1146the total stopping time

Highest value reached23,5841× the starting value

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

First steps15,722 → 7,861 → 23,584 → 11,792 → 5,896 → 2,948 → 1,474 → 737 → 2,212 → 1,106 → …

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

As a percentage & fraction

As a percentage1,572,200%

15,722% as a decimal157.22

15,722% of 10015,722

15,722% of 1,000157,220

As a fraction of 10015,722/100

Read another way

As seconds4 hours, 22 minutes and 2 seconds

As bytes15.354 KiB

As a 24-bit colour#003D6A

Keep nerding

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