Nerdulator> put something in

Recognised as Number

15,906

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

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

Factors & divisors

Prime factorisation2 × 3 × 11 × 241
Distinct prime factors42, 3, 11, 241
Number of divisors16
Sum of divisors σ(n)34,848
Aliquot sum18,942sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)4,800integers below n that share no factor with it
Carmichael function λ(n)240the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,800
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 11, 22, 33, 66, 241, 482, 723, 1,446, 2,651, 5,302, 7,953, 15,90616 in total

Arithmetic

Previous number15,905
Next number15,907
Double31,812
Half7,953
Square root126.118991433≈irrational, shown to 9 decimal places
Cube root25.148977136≈
Negation-15,906
Reciprocal0.0000628694≈

Representations

Decimal15,906
Binary1111100010001014 bits
Octal37042
Hexadecimal3E22
Base 36C9U
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifteen thousand, nine hundred and six
Ordinalfifteen thousand, nine hundred and sixth
Scientific notation1.5906 × 10^4
Engineering notation15.906 × 10^3

In other bases

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

Bit-level

0011111000100010
Bit length14 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits7within that length
Bit parityodd7 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
Bytes23e 22
Gray code10000100110011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011111000100010
32-bit00000000000000000011111000100010
64-bit0000000000000000000000000000000000000000000000000011111000100010
One's complement1100000111011101at 16 bits, every bit flipped
Bits reversed0100010001111100at 16 bits
Rotated left by 10111110001000100at 16 bits, wrapping
Shifted left by 1111110001000100= 31,812, no wrap
Shifted right by 11111100010001= 7,953, discarding the low bit
These bits as a double7.85860816 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime15,907+1
Previous prime15,901−5
Distance to nearest prime1
Nearest square below15,876
Nearest square above16,129

Powers & multiples

15,906 to the power 2253,000,836
15,906 to the power 34,024,231,297,416
15,906 to the power 464,009,423,016,698,896
15,906 to the power 51,018,133,882,503,612,639,776
First ten multiples15,906, 31,812, 47,718, 63,624, 79,530, 95,436, 111,342, 127,248, 143,154, 159,060
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 197the total stopping time
Highest value reached23,8601× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps15,906 → 7,953 → 23,860 → 11,930 → 5,965 → 17,896 → 8,948 → 4,474 → 2,237 → 6,712 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,590,600%
15,906% as a decimal159.06
15,906% of 10015,906
15,906% of 1,000159,060
As a fraction of 10015,906/100

Read another way

As bytes15.533 KiB
As a 24-bit colour#003E22

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