Recognised as Number
1,334,195
- Positive
- Odd
- Composite
- 7 digits
1,334,195 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,334,195
Digit count7
Digit sum26
Digit product1,620
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 factorisation5 × 266,839
Distinct prime factors25, 266,839
Number of divisors4
Sum of divisors σ(n)1,601,040
Aliquot sum266,845sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,067,352integers below n that share no factor with it
Carmichael function λ(n)533,676the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,067,352
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 266,839, 1,334,1954 in total
Arithmetic
Previous number1,334,194
Next number1,334,196
Double2,668,390
Half667,097.5
Square1,780,076,298,025
Cube2,374,968,896,443,464,875
Square root1,155.073590729≈irrational, shown to 9 decimal places
Cube root110.087946196≈
Negation-1,334,195
Reciprocal7.49515626 × 10^-7≈
Representations
Decimal1,334,195
Binary10100010110111011001121 bits
Octal5055663
Hexadecimal145BB3
Base 36SLGZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and thirty-four thousand, one hundred and ninety-five
Ordinalone million, three hundred and thirty-four thousand, one hundred and ninety-fifth
Scientific notation1.334195 × 10^6
Engineering notation1.334195 × 10^6
In other bases
Ternary2111210011122base 3; the most digit-efficient integer base after e: 13 digits
Quinary320143240base 5; one hand: 9 digits
Septenary14224532base 7: 8 digits
Nonary2453148base 9; each digit is two ternary digits: 7 digits
Duodecimal54412bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal86f9fbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:10:36:35base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTTT101TTT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011010110011110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000101101110110011
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes314 5b b3
Gray code111100111011001101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000101101110110011
64-bit0000000000000000000000000000000000000000000101000101101110110011
One's complement11111111111010111010010001001100at 32 bits, every bit flipped
Bits reversed11001101110110100010100000000000at 32 bits
Rotated left by 100000000001010001011011101100110at 32 bits, wrapping
Shifted left by 11010001011011101100110= 2,668,390, no wrap
Shifted right by 110100010110111011001= 667,097, discarding the low bit
These bits as a double6.59179914 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,334,195 to the power 21,780,076,298,025
1,334,195 to the power 32,374,968,896,443,464,875
1,334,195 to the power 43,168,671,626,790,388,618,900,625
1,334,195 to the power 54,227,625,841,105,602,543,394,119,371,875
First ten multiples1,334,195, 2,668,390, 4,002,585, 5,336,780, 6,670,975, 8,005,170, 9,339,365, 10,673,560, 12,007,755, 13,341,950
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 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 5
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 95
Collatz (3n + 1) trajectory
Steps to reach 198the total stopping time
Highest value reached6,003,8804× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,334,195 → 4,002,586 → 2,001,293 → 6,003,880 → 3,001,940 → 1,500,970 → 750,485 → 2,251,456 → 1,125,728 → 562,864 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage133,419,500%
1,334,195% as a decimal13,341.95
1,334,195% of 1001,334,195
1,334,195% of 1,00013,341,950
As a fraction of 1001,334,195/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,195
Nerdulate something else
Nothing in mind? Surprise me · today’s page