Recognised as Number
1,291,999
- Positive
- Odd
- Prime
- 7 digits
1,291,999 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,291,999
Digit count7
Digit sum40
Digit product13,122
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,291,999
Distinct prime factors11,291,999
Number of divisors2
Sum of divisors σ(n)1,292,000
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,291,998integers below n that share no factor with it
Carmichael function λ(n)1,291,998the 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, 1,291,9992 in total
Arithmetic
Previous number1,291,998
Next number1,292,000
Double2,583,998
Half645,999.5
Square1,669,261,416,001
Cube2,156,684,080,211,875,999
Square root1,136.661339186≈irrational, shown to 9 decimal places
Cube root108.914923935≈
Negation-1,291,999
Reciprocal7.73994407 × 10^-7≈
Representations
Decimal1,291,999
Binary10011101101101101111121 bits
Octal4733337
Hexadecimal13B6DF
Base 36ROWV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and ninety-one thousand, nine hundred and ninety-nine
Ordinalone million, two hundred and ninety-one thousand, nine hundred and ninety-ninth
Scientific notation1.291999 × 10^6
Engineering notation1.291999 × 10^6
In other bases
Ternary2102122021211base 3; the most digit-efficient integer base after e: 13 digits
Quinary312320444base 5; one hand: 9 digits
Septenary13660522base 7: 8 digits
Nonary2378254base 9; each digit is two ternary digits: 7 digits
Duodecimal523827base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal819jjbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:58:53:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T110T0T10TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101001100101100100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100111011011011011111
Bit length21 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits6within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes313 b6 df
Gray code110100110110110110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100111011011011011111
64-bit0000000000000000000000000000000000000000000100111011011011011111
One's complement11111111111011000100100100100000at 32 bits, every bit flipped
Bits reversed11111011011011011100100000000000at 32 bits
Rotated left by 100000000001001110110110110111110at 32 bits, wrapping
Shifted left by 11001110110110110111110= 2,583,998, no wrap
Shifted right by 110011101101101101111= 645,999, discarding the low bit
These bits as a double6.3833232 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,291,999 to the power 21,669,261,416,001
1,291,999 to the power 32,156,684,080,211,875,999
1,291,999 to the power 42,786,433,674,949,663,578,832,001
1,291,999 to the power 53,600,069,521,601,290,394,187,366,459,999
First ten multiples1,291,999, 2,583,998, 3,875,997, 5,167,996, 6,459,995, 7,751,994, 9,043,993, 10,335,992, 11,627,991, 12,919,990
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
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 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 1173the total stopping time
Highest value reached19,622,24815× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,291,999 → 3,875,998 → 1,937,999 → 5,813,998 → 2,906,999 → 8,720,998 → 4,360,499 → 13,081,498 → 6,540,749 → 19,622,248 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage129,199,900%
1,291,999% as a decimal12,919.99
1,291,999% of 1001,291,999
1,291,999% of 1,00012,919,990
As a fraction of 1001,291,999/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 1,291,999
Nerdulate something else
Nothing in mind? Surprise me · today’s page