Nerdulator> put something in

Recognised as Number

15,904

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value15,904
Digit count5
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^5 × 7 × 71
Distinct prime factors32, 7, 71
Number of divisors24
Sum of divisors σ(n)36,288
Aliquot sum20,384sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)6,720integers below n that share no factor with it
Carmichael function λ(n)840the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,720
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 71, 112, 142, 224, 284, 497, 568, 994, 1,136, 1,988, 2,272, 3,976, 7,952, 15,90424 in total

Arithmetic

Previous number15,903
Next number15,905
Double31,808
Half7,952
Square root126.111062163≈irrational, shown to 9 decimal places
Cube root25.147923025≈
Negation-15,904
Reciprocal0.0000628773≈

Representations

Decimal15,904
Binary1111100010000014 bits
Octal37040
Hexadecimal3E20
Base 36C9S
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifteen thousand, nine hundred and four
Ordinalfifteen thousand, nine hundred and fourth
Scientific notation1.5904 × 10^4
Engineering notation15.904 × 10^3

In other bases

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

Bit-level

0011111000100000
Bit length14 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits8within that length
Bit parityeven6 set bits, so even; not the same as the number itself being even
Highest set bitbit 13worth 8,192
Lowest set bitbit 55 trailing zeros
Power of twoNo
Bytes23e 20
Gray code10000100110000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011111000100000
32-bit00000000000000000011111000100000
64-bit0000000000000000000000000000000000000000000000000011111000100000
One's complement1100000111011111at 16 bits, every bit flipped
Bits reversed0000010001111100at 16 bits
Rotated left by 10111110001000000at 16 bits, wrapping
Shifted left by 1111110001000000= 31,808, no wrap
Shifted right by 11111100010000= 7,952, discarding the low bit
These bits as a double7.85762003 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime15,907+3
Previous prime15,901−3
Distance to nearest prime3
Nearest square below15,876
Nearest square above16,129

Powers & multiples

15,904 to the power 2252,937,216
15,904 to the power 34,022,713,483,264
15,904 to the power 463,977,235,237,830,656
15,904 to the power 51,017,493,949,222,458,753,024
First ten multiples15,904, 31,808, 47,712, 63,616, 79,520, 95,424, 111,328, 127,232, 143,136, 159,040
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 127the total stopping time
Highest value reached15,904
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps15,904 → 7,952 → 3,976 → 1,988 → 994 → 497 → 1,492 → 746 → 373 → 1,120 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,590,400%
15,904% as a decimal159.04
15,904% of 10015,904
15,904% of 1,000159,040
As a fraction of 10015,904/100

Read another way

As bytes15.531 KiB
As a 24-bit colour#003E20

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