Recognised as Number
31,808
- Positive
- Even
- Composite
- 5 digits
31,808 is an even 5-digit integer and a composite number. It has 28 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value31,808
Digit count5
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^6 × 7 × 71
Distinct prime factors32, 7, 71
Number of divisors28
Sum of divisors σ(n)73,152
Aliquot sum41,344sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)13,440integers below n that share no factor with it
Carmichael function λ(n)1,680the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 13,440
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, 64, 71, 112, 142, 224, 284, 448, 497, 568, 994, 1,136, 1,988, 2,272, 3,976, 4,544, 7,952, 15,904, 31,80828 in total
Arithmetic
Representations
Decimal31,808
Binary11111000100000015 bits
Octal76100
Hexadecimal7C40
Base 36OJK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-one thousand, eight hundred and eight
Ordinalthirty-one thousand, eight hundred and eighth
Scientific notation3.1808 × 10^4
Engineering notation31.808 × 10^3
In other bases
Ternary1121122002base 3; the most digit-efficient integer base after e: 10 digits
Quinary2004213base 5; one hand: 7 digits
Septenary161510base 7: 6 digits
Nonary47562base 9; each digit is two ternary digits: 5 digits
Duodecimal164a8base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3ja8base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:50:8base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT0TT0T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000110001000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0111110001000000
Bit length15 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits9within that length
Bit parityeven6 set bits, so even; not the same as the number itself being even
Highest set bitbit 14worth 16,384
Lowest set bitbit 66 trailing zeros
Power of twoNo
Bytes27c 40
Gray code100001001100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit0111110001000000
32-bit00000000000000000111110001000000
64-bit0000000000000000000000000000000000000000000000000111110001000000
One's complement1000001110111111at 16 bits, every bit flipped
Bits reversed0000001000111110at 16 bits
Rotated left by 11111100010000000at 16 bits, wrapping
Shifted left by 11111100010000000= 63,616, no wrap
Shifted right by 111111000100000= 15,904, discarding the low bit
These bits as a double1.57152401 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
31,808 to the power 21,011,748,864
31,808 to the power 332,181,707,866,112
31,808 to the power 41,023,635,763,805,290,496
31,808 to the power 532,559,806,375,118,680,096,768
First ten multiples31,808, 63,616, 95,424, 127,232, 159,040, 190,848, 222,656, 254,464, 286,272, 318,080
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10No, remainder 8
Divisible by 11No, remainder 7
Divisible by 12No, remainder 8
Divisible by 100No, remainder 8
Collatz (3n + 1) trajectory
Steps to reach 128the total stopping time
Highest value reached31,808
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps31,808 → 15,904 → 7,952 → 3,976 → 1,988 → 994 → 497 → 1,492 → 746 → 373 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage3,180,800%
31,808% as a decimal318.08
31,808% of 10031,808
31,808% of 1,000318,080
As a fraction of 10031,808/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 31,808
Nerdulate something else
Nothing in mind? Surprise me · today’s page