Recognised as Number
1,343,547
- Positive
- Odd
- Composite
- 7 digits
1,343,547 is an odd 7-digit integer and a composite number. It has 28 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,343,547
Digit count7
Digit sum27
Digit product5,040
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3^6 × 19 × 97
Distinct prime factors33, 19, 97
Number of divisors28
Sum of divisors σ(n)2,142,280
Aliquot sum798,733sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)839,808integers below n that share no factor with it
Carmichael function λ(n)7,776the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 839,808
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 19, 27, 57, 81, 97, 171, 243, 291, 513, 729, 873, 1,539, 1,843, 2,619, 4,617, 5,529, 7,857, 13,851, 16,587, 23,571, 49,761, 70,713, 149,283, 447,849, 1,343,54728 in total
Arithmetic
Previous number1,343,546
Next number1,343,548
Double2,687,094
Half671,773.5
Square1,805,118,541,209
Cube2,425,261,600,685,728,323
Square root1,159.114748418≈irrational, shown to 9 decimal places
Cube root110.344566925≈
Negation-1,343,547
Reciprocal7.44298488 × 10^-7≈
Representations
Decimal1,343,547
Binary10100100000000011101121 bits
Octal5100073
Hexadecimal14803B
Base 36SSOR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and forty-three thousand, five hundred and forty-seven
Ordinalone million, three hundred and forty-three thousand, five hundred and forty-seventh
Scientific notation1.343547 × 10^6
Engineering notation1.343547 × 10^6
In other bases
Ternary2112021000000base 3; the most digit-efficient integer base after e: 13 digits
Quinary320443142base 5; one hand: 9 digits
Septenary14264022base 7: 8 digits
Nonary2467000base 9; each digit is two ternary digits: 7 digits
Duodecimal549623base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal87ih7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:13:12:27base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT1T1000000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011000000001001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001000000000111011
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 80 3b
Gray code111101100000000100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001000000000111011
64-bit0000000000000000000000000000000000000000000101001000000000111011
One's complement11111111111010110111111111000100at 32 bits, every bit flipped
Bits reversed11011100000000010010100000000000at 32 bits
Rotated left by 100000000001010010000000001110110at 32 bits, wrapping
Shifted left by 11010010000000001110110= 2,687,094, no wrap
Shifted right by 110100100000000011101= 671,773, discarding the low bit
These bits as a double6.63800416 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,343,547 to the power 21,805,118,541,209
1,343,547 to the power 32,425,261,600,685,728,323
1,343,547 to the power 43,258,452,947,816,508,231,181,681
1,343,547 to the power 54,377,884,682,680,026,184,479,453,962,507
First ten multiples1,343,547, 2,687,094, 4,030,641, 5,374,188, 6,717,735, 8,061,282, 9,404,829, 10,748,376, 12,091,923, 13,435,470
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 198the total stopping time
Highest value reached6,801,7125× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,343,547 → 4,030,642 → 2,015,321 → 6,045,964 → 3,022,982 → 1,511,491 → 4,534,474 → 2,267,237 → 6,801,712 → 3,400,856 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage134,354,700%
1,343,547% as a decimal13,435.47
1,343,547% of 1001,343,547
1,343,547% of 1,00013,435,470
As a fraction of 1001,343,547/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,343,547
Nerdulate something else
Nothing in mind? Surprise me · today’s page