Recognised as Number

12,791

Positive
Odd
Prime
5 digits

12,791 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 value12,791

Digit count5

Digit sum20

Digit product126

Multiplicative persistence3times 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 factorisation12,791

Distinct prime factors112,791

Number of divisors2

Sum of divisors σ(n)12,792

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)12,790integers below n that share no factor with it

Carmichael function λ(n)12,790the 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,7912 in total

Arithmetic

Previous number12,790

Next number12,792

Double25,582

Half6,395.5

Square163,609,681

Cube2,092,731,429,671

Square root113.097303239≈irrational, shown to 9 decimal places

Cube root23.386658087≈

Negation-12,791

Reciprocal0.00007818≈

Representations

Decimal12,791

Binary1100011111011114 bits

Octal30767

Hexadecimal31F7

Base 369VB

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordstwelve thousand, seven hundred and ninety-one

Ordinaltwelve thousand, seven hundred and ninety-first

Scientific notation1.2791 × 10^4

Engineering notation12.791 × 10^3

In other bases

Ternary122112202base 3; the most digit-efficient integer base after e: 9 digits

Quinary402131base 5; one hand: 6 digits

Septenary52202base 7: 5 digits

Nonary18482base 9; each digit is two ternary digits: 5 digits

Duodecimal749bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits

Vigesimal1bjbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal3:33:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1T00TT0T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary111011000001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011000111110111

Bit length14 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits4within that length

Bit parityeven10 set bits, so even; 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 f7

Gray code10100100001100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011000111110111

32-bit00000000000000000011000111110111

64-bit0000000000000000000000000000000000000000000000000011000111110111

One's complement1100111000001000at 16 bits, every bit flipped

Bits reversed1110111110001100at 16 bits

Rotated left by 10110001111101110at 16 bits, wrapping

Shifted left by 1110001111101110= 25,582, no wrap

Shifted right by 11100011111011= 6,395, discarding the low bit

These bits as a double6.31959368 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime12,799+8

Previous prime12,781−10

Distance to nearest prime0, it is prime

Nearest square below12,769

Nearest square above12,996

Powers & multiples

12,791 to the power 2163,609,681

12,791 to the power 32,092,731,429,671

12,791 to the power 426,768,127,716,921,761

12,791 to the power 5342,391,121,627,146,244,951

First ten multiples12,791, 25,582, 38,373, 51,164, 63,955, 76,746, 89,537, 102,328, 115,119, 127,910

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 7

Divisible by 9No, remainder 2

Divisible by 10No, remainder 1

Divisible by 11No, remainder 9

Divisible by 12No, remainder 11

Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 1125the total stopping time

Highest value reached599,05646× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps12,791 → 38,374 → 19,187 → 57,562 → 28,781 → 86,344 → 43,172 → 21,586 → 10,793 → 32,380 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,279,100%

12,791% as a decimal127.91

12,791% of 10012,791

12,791% of 1,000127,910

As a fraction of 10012,791/100

Read another way

As seconds3 hours, 33 minutes and 11 seconds

As bytes12.491 KiB

As a 24-bit colour#0031F7

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.