Recognised as Number
6,741,155
- Positive
- Odd
- Composite
- 7 digits
6,741,155 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 value6,741,155
Digit count7
Digit sum29
Digit product4,200
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 factorisation5 × 1,348,231
Distinct prime factors25, 1,348,231
Number of divisors4
Sum of divisors σ(n)8,089,392
Aliquot sum1,348,237sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,392,920integers below n that share no factor with it
Carmichael function λ(n)2,696,460the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,392,920
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 1,348,231, 6,741,1554 in total
Arithmetic
Previous number6,741,154
Next number6,741,156
Double13,482,310
Half3,370,577.5
Square45,443,170,734,025
Cube306,339,457,609,526,298,875
Square root2,596.373432309≈irrational, shown to 9 decimal places
Cube root188.905573241≈
Negation-6,741,155
Reciprocal1.48342532 × 10^-7≈
Representations
Decimal6,741,155
Binary1100110110111001010001123 bits
Octal31556243
Hexadecimal66DCA3
Base 3640HIB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, seven hundred and forty-one thousand, one hundred and fifty-five
Ordinalsix million, seven hundred and forty-one thousand, one hundred and fifty-fifth
Scientific notation6.741155 × 10^6
Engineering notation6.741155 × 10^6
In other bases
Ternary110200111010102base 3; the most digit-efficient integer base after e: 15 digits
Quinary3211204110base 5; one hand: 10 digits
Septenary111204341base 7: 9 digits
Nonary13614112base 9; each digit is two ternary digits: 8 digits
Duodecimal231116bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal222chfbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:12:32:35base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T0011101011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110110010110111100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011001101101110010100011
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes366 dc a3
Gray code10101011011001011110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011001101101110010100011
64-bit0000000000000000000000000000000000000000011001101101110010100011
One's complement11111111100110010010001101011100at 32 bits, every bit flipped
Bits reversed11000101001110110110011000000000at 32 bits
Rotated left by 100000000110011011011100101000110at 32 bits, wrapping
Shifted left by 1110011011011100101000110= 13,482,310, no wrap
Shifted right by 11100110110111001010001= 3,370,577, discarding the low bit
These bits as a double3.3305731 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,741,155 to the power 245,443,170,734,025
6,741,155 to the power 3306,339,457,609,526,298,875
6,741,155 to the power 42,065,081,766,361,746,257,292,700,625
6,741,155 to the power 513,921,036,274,718,317,591,079,975,281,721,875
First ten multiples6,741,155, 13,482,310, 20,223,465, 26,964,620, 33,705,775, 40,446,930, 47,188,085, 53,929,240, 60,670,395, 67,411,550
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
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 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 55
Collatz (3n + 1) trajectory
Steps to reach 1222the total stopping time
Highest value reached30,335,2004× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,741,155 → 20,223,466 → 10,111,733 → 30,335,200 → 15,167,600 → 7,583,800 → 3,791,900 → 1,895,950 → 947,975 → 2,843,926 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage674,115,500%
6,741,155% as a decimal67,411.55
6,741,155% of 1006,741,155
6,741,155% of 1,00067,411,550
As a fraction of 1006,741,155/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 6,741,155
Nerdulate something else
Nothing in mind? Surprise me · today’s page