Recognised as Number
1,317,899
- Positive
- Odd
- Composite
- 7 digits
1,317,899 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,317,899
Digit count7
Digit sum38
Digit product13,608
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 factorisation11 × 119,809
Distinct prime factors211, 119,809
Number of divisors4
Sum of divisors σ(n)1,437,720
Aliquot sum119,821sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,198,080integers below n that share no factor with it
Carmichael function λ(n)599,040the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,198,080
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 119,809, 1,317,8994 in total
Arithmetic
Previous number1,317,898
Next number1,317,900
Double2,635,798
Half658,949.5
Square1,736,857,774,201
Cube2,289,003,123,761,723,699
Square root1,147.997822298≈irrational, shown to 9 decimal places
Cube root109.637900251≈
Negation-1,317,899
Reciprocal7.58783488 × 10^-7≈
Representations
Decimal1,317,899
Binary10100000111000000101121 bits
Octal5016013
Hexadecimal141C0B
Base 36S8WB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and seventeen thousand, eight hundred and ninety-nine
Ordinalone million, three hundred and seventeen thousand, eight hundred and ninety-ninth
Scientific notation1.317899 × 10^6
Engineering notation1.317899 × 10^6
In other bases
Ternary2110221211002base 3; the most digit-efficient integer base after e: 13 digits
Quinary314133044base 5; one hand: 9 digits
Septenary14126162base 7: 8 digits
Nonary2427732base 9; each digit is two ternary digits: 7 digits
Duodecimal53680bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal84eejbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:6:4:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11100TT1101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000110110000011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000001110000001011
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; 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
Bytes314 1c 0b
Gray code111100001001000001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000001110000001011
64-bit0000000000000000000000000000000000000000000101000001110000001011
One's complement11111111111010111110001111110100at 32 bits, every bit flipped
Bits reversed11010000001110000010100000000000at 32 bits
Rotated left by 100000000001010000011100000010110at 32 bits, wrapping
Shifted left by 11010000011100000010110= 2,635,798, no wrap
Shifted right by 110100000111000000101= 658,949, discarding the low bit
These bits as a double6.51128621 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,317,899 to the power 21,736,857,774,201
1,317,899 to the power 32,289,003,123,761,723,699
1,317,899 to the power 43,016,674,927,802,451,901,188,401
1,317,899 to the power 53,975,672,870,675,923,558,124,292,489,499
First ten multiples1,317,899, 2,635,798, 3,953,697, 5,271,596, 6,589,495, 7,907,394, 9,225,293, 10,543,192, 11,861,091, 13,178,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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 1124the total stopping time
Highest value reached5,930,5484× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,317,899 → 3,953,698 → 1,976,849 → 5,930,548 → 2,965,274 → 1,482,637 → 4,447,912 → 2,223,956 → 1,111,978 → 555,989 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage131,789,900%
1,317,899% as a decimal13,178.99
1,317,899% of 1001,317,899
1,317,899% of 1,00013,178,990
As a fraction of 1001,317,899/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,317,899
Nerdulate something else
Nothing in mind? Surprise me · today’s page