Recognised as Number

15,729

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value15,729

Digit count5

Digit sum24

Digit product630

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 7^2 × 107

Distinct prime factors33, 7, 107

Number of divisors12

Sum of divisors σ(n)24,624

Aliquot sum8,895sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,226the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,904

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 7, 21, 49, 107, 147, 321, 749, 2,247, 5,243, 15,72912 in total

Arithmetic

Previous number15,728

Next number15,730

Double31,458

Half7,864.5

Square247,401,441

Cube3,891,377,265,489

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

Cube root25.055344058≈

Negation-15,729

Reciprocal0.0000635768≈

Representations

Decimal15,729

Binary1111010111000114 bits

Octal36561

Hexadecimal3D71

Base 36C4X

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

In wordsfifteen thousand, seven hundred and twenty-nine

Ordinalfifteen thousand, seven hundred and twenty-ninth

Scientific notation1.5729 × 10^4

Engineering notation15.729 × 10^3

In other bases

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

Quinary1000404base 5; one hand: 7 digits

Septenary63600base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011110101110001

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 odd

Highest set bitbit 13worth 8,192

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes23d 71

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

At each machine width

16-bit0011110101110001

32-bit00000000000000000011110101110001

64-bit0000000000000000000000000000000000000000000000000011110101110001

One's complement1100001010001110at 16 bits, every bit flipped

Bits reversed1000111010111100at 16 bits

Rotated left by 10111101011100010at 16 bits, wrapping

Shifted left by 1111101011100010= 31,458, no wrap

Shifted right by 11111010111000= 7,864, discarding the low bit

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

Nearest landmarks

Next prime15,731+2

Previous prime15,727−2

Distance to nearest prime2

Nearest square below15,625

Nearest square above15,876

Powers & multiples

15,729 to the power 2247,401,441

15,729 to the power 33,891,377,265,489

15,729 to the power 461,207,473,008,876,481

15,729 to the power 5962,732,342,956,618,169,649

First ten multiples15,729, 31,458, 47,187, 62,916, 78,645, 94,374, 110,103, 125,832, 141,561, 157,290

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 1

Divisible by 9No, remainder 6

Divisible by 10No, remainder 9

Divisible by 11No, remainder 10

Divisible by 12No, remainder 9

Divisible by 100No, remainder 29

Collatz (3n + 1) trajectory

Steps to reach 1146the total stopping time

Highest value reached47,1883× the starting value

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

First steps15,729 → 47,188 → 23,594 → 11,797 → 35,392 → 17,696 → 8,848 → 4,424 → 2,212 → 1,106 → …

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

As a percentage & fraction

As a percentage1,572,900%

15,729% as a decimal157.29

15,729% of 10015,729

15,729% of 1,000157,290

As a fraction of 10015,729/100

Read another way

As seconds4 hours, 22 minutes and 9 seconds

As bytes15.36 KiB

As a 24-bit colour#003D71

Keep nerding

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