Recognised as Number
6,555,041
- Positive
- Odd
- Prime
- 7 digits
6,555,041 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value6,555,041
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation6,555,041
Distinct prime factors16,555,041
Number of divisors2
Sum of divisors σ(n)6,555,042
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,555,040integers below n that share no factor with it
Carmichael function λ(n)6,555,040the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 6,555,0412 in total
Arithmetic
Previous number6,555,040
Next number6,555,042
Double13,110,082
Half3,277,520.5
Square42,968,562,511,681
Cube281,660,688,975,131,933,921
Square root2,560.281429843≈irrational, shown to 9 decimal places
Cube root187.150850092≈
Negation-6,555,041
Reciprocal1.52554347 × 10^-7≈
Representations
Decimal6,555,041
Binary1100100000001011010000123 bits
Octal31002641
Hexadecimal6405A1
Base 363WHWH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, five hundred and fifty-five thousand and forty-one
Ordinalsix million, five hundred and fifty-five thousand and forty-first
Scientific notation6.555041 × 10^6
Engineering notation6.555041 × 10^6
In other bases
Ternary110100000211022base 3; the most digit-efficient integer base after e: 15 digits
Quinary3134230131base 5; one hand: 10 digits
Septenary106500623base 7: 9 digits
Nonary13300738base 9; each digit is two ternary digits: 8 digits
Duodecimal2241515base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal20j7c1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal30:20:50:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110100001T1110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101001000001101011100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011001000000010110100001
Bit length23 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits15within that length
Bit parityeven8 set bits, so even; 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
Bytes364 05 a1
Gray code10101100000011101110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011001000000010110100001
64-bit0000000000000000000000000000000000000000011001000000010110100001
One's complement11111111100110111111101001011110at 32 bits, every bit flipped
Bits reversed10000101101000000010011000000000at 32 bits
Rotated left by 100000000110010000000101101000010at 32 bits, wrapping
Shifted left by 1110010000000101101000010= 13,110,082, no wrap
Shifted right by 11100100000001011010000= 3,277,520, discarding the low bit
These bits as a double3.23862057 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,555,041 to the power 242,968,562,511,681
6,555,041 to the power 3281,660,688,975,131,933,921
6,555,041 to the power 41,846,297,364,320,237,807,261,445,761
6,555,041 to the power 512,102,554,921,311,095,956,348,874,682,631,201
First ten multiples6,555,041, 13,110,082, 19,665,123, 26,220,164, 32,775,205, 39,330,246, 45,885,287, 52,440,328, 58,995,369, 65,550,410
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1147the total stopping time
Highest value reached19,665,1243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,555,041 → 19,665,124 → 9,832,562 → 4,916,281 → 14,748,844 → 7,374,422 → 3,687,211 → 11,061,634 → 5,530,817 → 16,592,452 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage655,504,100%
6,555,041% as a decimal65,550.41
6,555,041% of 1006,555,041
6,555,041% of 1,00065,550,410
As a fraction of 1006,555,041/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,555,041
Nerdulate something else
Nothing in mind? Surprise me · today’s page