Nerdulator> put something in

Recognised as Number

12,799

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

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

Arithmetic

Previous number12,798
Next number12,800
Double25,598
Square root113.132665486≈irrational, shown to 9 decimal places
Cube root23.391532719≈
Negation-12,799
Reciprocal0.0000781311≈

Representations

Decimal12,799
Binary1100011111111114 bits
Octal30777
Hexadecimal31FF
Base 369VJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwelve thousand, seven hundred and ninety-nine
Ordinaltwelve thousand, seven hundred and ninety-ninth
Scientific notation1.2799 × 10^4
Engineering notation12.799 × 10^3

In other bases

Ternary122120001base 3; the most digit-efficient integer base after e: 9 digits
Quinary402144base 5; one hand: 6 digits
Septenary52213base 7: 5 digits
Nonary18501base 9; each digit is two ternary digits: 5 digits
Duodecimal74a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1bjjbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:33:19base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T00TT0001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111011000000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011000111111111
Bit length14 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits3within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes231 ff
Gray code10100100000000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011000111111111
32-bit00000000000000000011000111111111
64-bit0000000000000000000000000000000000000000000000000011000111111111
One's complement1100111000000000at 16 bits, every bit flipped
Bits reversed1111111110001100at 16 bits
Rotated left by 10110001111111110at 16 bits, wrapping
Shifted left by 1110001111111110= 25,598, no wrap
Shifted right by 11100011111111= 6,399, discarding the low bit
These bits as a double6.3235462 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime12,809+10
Previous prime12,791−8
Distance to nearest prime0, it is prime
Nearest square below12,769
Nearest square above12,996

Powers & multiples

12,799 to the power 2163,814,401
12,799 to the power 32,096,660,518,399
12,799 to the power 426,835,157,974,988,801
12,799 to the power 5343,463,186,921,881,663,999
First ten multiples12,799, 25,598, 38,397, 51,196, 63,995, 76,794, 89,593, 102,392, 115,191, 127,990
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 99

Collatz (3n + 1) trajectory

Steps to reach 1169the total stopping time
Highest value reached984,14876× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps12,799 → 38,398 → 19,199 → 57,598 → 28,799 → 86,398 → 43,199 → 129,598 → 64,799 → 194,398 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,279,900%
12,799% as a decimal127.99
12,799% of 10012,799
12,799% of 1,000127,990
As a fraction of 10012,799/100

Read another way

As bytes12.499 KiB
As a 24-bit colour#0031FF

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