Recognised as Number
1,334,246
- Positive
- Even
- Composite
- 7 digits
1,334,246 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,334,246
Digit count7
Digit sum23
Digit product1,728
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 667,123
Distinct prime factors22, 667,123
Number of divisors4
Sum of divisors σ(n)2,001,372
Aliquot sum667,126sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)667,122integers below n that share no factor with it
Carmichael function λ(n)667,122the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 667,123, 1,334,2464 in total
Arithmetic
Previous number1,334,245
Next number1,334,247
Double2,668,492
Half667,123
Square1,780,212,388,516
Cube2,375,241,258,527,918,936
Square root1,155.095667034≈irrational, shown to 9 decimal places
Cube root110.089348893≈
Negation-1,334,246
Reciprocal7.49486976 × 10^-7≈
Representations
Decimal1,334,246
Binary10100010110111110011021 bits
Octal5055746
Hexadecimal145BE6
Base 36SLIE
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and thirty-four thousand, two hundred and forty-six
Ordinalone million, three hundred and thirty-four thousand, two hundred and forty-sixth
Scientific notation1.334246 × 10^6
Engineering notation1.334246 × 10^6
In other bases
Ternary2111210020112base 3; the most digit-efficient integer base after e: 13 digits
Quinary320143441base 5; one hand: 9 digits
Septenary14224634base 7: 8 digits
Nonary2453215base 9; each digit is two ternary digits: 7 digits
Duodecimal544172base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal86fc6base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:10:37:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTTT101T1TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011010110000111010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000101101111100110
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 set bits, so even; 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 5b e6
Gray code111100111011000010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000101101111100110
64-bit0000000000000000000000000000000000000000000101000101101111100110
One's complement11111111111010111010010000011001at 32 bits, every bit flipped
Bits reversed01100111110110100010100000000000at 32 bits
Rotated left by 100000000001010001011011111001100at 32 bits, wrapping
Shifted left by 11010001011011111001100= 2,668,492, no wrap
Shifted right by 110100010110111110011= 667,123, discarding the low bit
These bits as a double6.59205112 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,334,246 to the power 21,780,212,388,516
1,334,246 to the power 32,375,241,258,527,918,936
1,334,246 to the power 43,169,156,148,225,841,728,682,256
1,334,246 to the power 54,228,433,914,145,736,423,127,385,338,976
First ten multiples1,334,246, 2,668,492, 4,002,738, 5,336,984, 6,671,230, 8,005,476, 9,339,722, 10,673,968, 12,008,214, 13,342,460
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 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9No, remainder 5
Divisible by 10No, remainder 6
Divisible by 11No, remainder 1
Divisible by 12No, remainder 2
Divisible by 100No, remainder 46
Collatz (3n + 1) trajectory
Steps to reach 1142the total stopping time
Highest value reached3,002,0562× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,334,246 → 667,123 → 2,001,370 → 1,000,685 → 3,002,056 → 1,501,028 → 750,514 → 375,257 → 1,125,772 → 562,886 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage133,424,600%
1,334,246% as a decimal13,342.46
1,334,246% of 1001,334,246
1,334,246% of 1,00013,342,460
As a fraction of 1001,334,246/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,334,246
Nerdulate something else
Nothing in mind? Surprise me · today’s page