Recognised as Number
1,337,966
- Positive
- Even
- Composite
- 7 digits
1,337,966 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,337,966
Digit count7
Digit sum35
Digit product20,412
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 7 × 95,569
Distinct prime factors32, 7, 95,569
Number of divisors8
Sum of divisors σ(n)2,293,680
Aliquot sum955,714sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)573,408integers below n that share no factor with it
Carmichael function λ(n)95,568the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 573,408
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 14, 95,569, 191,138, 668,983, 1,337,9668 in total
Arithmetic
Previous number1,337,965
Next number1,337,967
Double2,675,932
Half668,983
Square1,790,153,017,156
Cube2,395,163,871,752,144,696
Square root1,156.704802445≈irrational, shown to 9 decimal places
Cube root110.191567015≈
Negation-1,337,966
Reciprocal7.47403148 × 10^-7≈
Representations
Decimal1,337,966
Binary10100011010100110111021 bits
Octal5065156
Hexadecimal146A6E
Base 36SODQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and thirty-seven thousand, nine hundred and sixty-six
Ordinalone million, three hundred and thirty-seven thousand, nine hundred and sixty-sixth
Scientific notation1.337966 × 10^6
Engineering notation1.337966 × 10^6
In other bases
Ternary2111222100022base 3; the most digit-efficient integer base after e: 13 digits
Quinary320303331base 5; one hand: 9 digits
Septenary14241530base 7: 8 digits
Nonary2458308base 9; each digit is two ternary digits: 7 digits
Duodecimal546352base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal874i6base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:11:39:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT00T10010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011011111110110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000110101001101110
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes314 6a 6e
Gray code111100101111101011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000110101001101110
64-bit0000000000000000000000000000000000000000000101000110101001101110
One's complement11111111111010111001010110010001at 32 bits, every bit flipped
Bits reversed01110110010101100010100000000000at 32 bits
Rotated left by 100000000001010001101010011011100at 32 bits, wrapping
Shifted left by 11010001101010011011100= 2,675,932, no wrap
Shifted right by 110100011010100110111= 668,983, discarding the low bit
These bits as a double6.61043036 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,337,966 to the power 21,790,153,017,156
1,337,966 to the power 32,395,163,871,752,144,696
1,337,966 to the power 43,204,647,824,832,730,030,328,336
1,337,966 to the power 54,287,709,831,600,148,467,758,282,404,576
First ten multiples1,337,966, 2,675,932, 4,013,898, 5,351,864, 6,689,830, 8,027,796, 9,365,762, 10,703,728, 12,041,694, 13,379,660
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 8
Divisible by 10No, remainder 6
Divisible by 11No, remainder 3
Divisible by 12No, remainder 2
Divisible by 100No, remainder 66
Collatz (3n + 1) trajectory
Steps to reach 1230the total stopping time
Highest value reached29,327,66821× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,337,966 → 668,983 → 2,006,950 → 1,003,475 → 3,010,426 → 1,505,213 → 4,515,640 → 2,257,820 → 1,128,910 → 564,455 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage133,796,600%
1,337,966% as a decimal13,379.66
1,337,966% of 1001,337,966
1,337,966% of 1,00013,379,660
As a fraction of 1001,337,966/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,337,966
Nerdulate something else
Nothing in mind? Surprise me · today’s page