Nerdulator> put something in

Recognised as Number

31,799

  • Positive
  • Odd
  • Prime
  • 5 digits

31,799 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value31,799
Digit count5
Digit sum29
Digit product1,701
Multiplicative persistence2times 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 factorisation31,799
Distinct prime factors131,799
Number of divisors2
Sum of divisors σ(n)31,800
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)31,798integers below n that share no factor with it
Carmichael function λ(n)31,798the 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, 31,7992 in total

Arithmetic

Previous number31,798
Next number31,800
Double63,598
Square root178.322741118≈irrational, shown to 9 decimal places
Cube root31.681408956≈
Negation-31,799
Reciprocal0.0000314475≈

Representations

Decimal31,799
Binary11111000011011115 bits
Octal76067
Hexadecimal7C37
Base 36OJB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-one thousand, seven hundred and ninety-nine
Ordinalthirty-one thousand, seven hundred and ninety-ninth
Scientific notation3.1799 × 10^4
Engineering notation31.799 × 10^3

In other bases

Ternary1121121202base 3; the most digit-efficient integer base after e: 10 digits
Quinary2004144base 5; one hand: 7 digits
Septenary161465base 7: 6 digits
Nonary47552base 9; each digit is two ternary digits: 5 digits
Duodecimal1649bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3j9jbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:49:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT0TT0TT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000110001001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0111110000110111
Bit length15 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits5within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes27c 37
Gray code100001000101100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0111110000110111
32-bit00000000000000000111110000110111
64-bit0000000000000000000000000000000000000000000000000111110000110111
One's complement1000001111001000at 16 bits, every bit flipped
Bits reversed1110110000111110at 16 bits
Rotated left by 11111100001101110at 16 bits, wrapping
Shifted left by 11111100001101110= 63,598, no wrap
Shifted right by 111111000011011= 15,899, discarding the low bit
These bits as a double1.57107935 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime31,817+18
Previous prime31,793−6
Distance to nearest prime0, it is prime
Nearest square below31,684
Nearest square above32,041

Powers & multiples

31,799 to the power 21,011,176,401
31,799 to the power 332,154,398,375,399
31,799 to the power 41,022,477,713,939,312,801
31,799 to the power 532,513,768,825,556,207,758,999
First ten multiples31,799, 63,598, 95,397, 127,196, 158,995, 190,794, 222,593, 254,392, 286,191, 317,990
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1160the total stopping time
Highest value reached619,64819× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps31,799 → 95,398 → 47,699 → 143,098 → 71,549 → 214,648 → 107,324 → 53,662 → 26,831 → 80,494 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,179,900%
31,799% as a decimal317.99
31,799% of 10031,799
31,799% of 1,000317,990
As a fraction of 10031,799/100

Read another way

As bytes31.054 KiB
As a 24-bit colour#007C37

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