Recognised as Number

15,331

Positive
Odd
Prime
5 digits

15,331 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,331

Digit count5

Digit sum13

Digit product45

Multiplicative persistence3times 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,331

Distinct prime factors115,331

Number of divisors2

Sum of divisors σ(n)15,332

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)15,330the 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,3312 in total

Arithmetic

Previous number15,330

Next number15,332

Double30,662

Half7,665.5

Square235,039,561

Cube3,603,391,509,691

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

Cube root24.842206139≈

Negation-15,331

Reciprocal0.0000652273≈

Representations

Decimal15,331

Binary1110111110001114 bits

Octal35743

Hexadecimal3BE3

Base 36BTV

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

In wordsfifteen thousand, three hundred and thirty-one

Ordinalfifteen thousand, three hundred and thirty-first

Scientific notation1.5331 × 10^4

Engineering notation15.331 × 10^3

In other bases

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

Quinary442311base 5; one hand: 6 digits

Septenary62461base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011101111100011

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 e3

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

At each machine width

16-bit0011101111100011

32-bit00000000000000000011101111100011

64-bit0000000000000000000000000000000000000000000000000011101111100011

One's complement1100010000011100at 16 bits, every bit flipped

Bits reversed1100011111011100at 16 bits

Rotated left by 10111011111000110at 16 bits, wrapping

Shifted left by 1111011111000110= 30,662, no wrap

Shifted right by 11110111110001= 7,665, discarding the low bit

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

Nearest landmarks

Next prime15,349+18

Previous prime15,329−2

Distance to nearest prime0, it is prime

Nearest square below15,129

Nearest square above15,376

Powers & multiples

15,331 to the power 2235,039,561

15,331 to the power 33,603,391,509,691

15,331 to the power 455,243,595,235,072,721

15,331 to the power 5846,939,558,548,899,885,651

First ten multiples15,331, 30,662, 45,993, 61,324, 76,655, 91,986, 107,317, 122,648, 137,979, 153,310

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 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 8

Divisible by 12No, remainder 7

Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time

Highest value reached68,9924× the starting value

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

First steps15,331 → 45,994 → 22,997 → 68,992 → 34,496 → 17,248 → 8,624 → 4,312 → 2,156 → 1,078 → …

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

As a percentage & fraction

As a percentage1,533,100%

15,331% as a decimal153.31

15,331% of 10015,331

15,331% of 1,000153,310

As a fraction of 10015,331/100

Read another way

As seconds4 hours, 15 minutes and 31 seconds

As bytes14.972 KiB

As a 24-bit colour#003BE3

Keep nerding

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