Recognised as Number
6,040,173
- Positive
- Odd
- Composite
- 7 digits
6,040,173 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value6,040,173
Digit count7
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 2,013,391
Distinct prime factors23, 2,013,391
Number of divisors4
Sum of divisors σ(n)8,053,568
Aliquot sum2,013,395sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,026,780integers below n that share no factor with it
Carmichael function λ(n)2,013,390the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,026,780
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 2,013,391, 6,040,1734 in total
Arithmetic
Previous number6,040,172
Next number6,040,174
Double12,080,346
Half3,020,086.5
Square36,483,689,869,929
Cube220,367,798,492,718,657,717
Square root2,457.676341588≈irrational, shown to 9 decimal places
Cube root182.116708544≈
Negation-6,040,173
Reciprocal1.65558172 × 10^-7≈
Representations
Decimal6,040,173
Binary1011100001010100110110123 bits
Octal27025155
Hexadecimal5C2A6D
Base 363LGML
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, forty thousand, one hundred and seventy-three
Ordinalsix million, forty thousand, one hundred and seventy-third
Scientific notation6.040173 × 10^6
Engineering notation6.040173 × 10^6
In other bases
Ternary102100212120010base 3; the most digit-efficient integer base after e: 15 digits
Quinary3021241143base 5; one hand: 10 digits
Septenary102224556base 7: 9 digits
Nonary12325503base 9; each digit is two ternary digits: 8 digits
Duodecimal2033579base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1hf08dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal27:57:49:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1010T0TT0010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101011000111111110111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010111000010101001101101
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 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
Bytes35c 2a 6d
Gray code11100100011111101011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010111000010101001101101
64-bit0000000000000000000000000000000000000000010111000010101001101101
One's complement11111111101000111101010110010010at 32 bits, every bit flipped
Bits reversed10110110010101000011101000000000at 32 bits
Rotated left by 100000000101110000101010011011010at 32 bits, wrapping
Shifted left by 1101110000101010011011010= 12,080,346, no wrap
Shifted right by 11011100001010100110110= 3,020,086, discarding the low bit
These bits as a double2.98424197 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,040,173 to the power 236,483,689,869,929
6,040,173 to the power 3220,367,798,492,718,657,717
6,040,173 to the power 41,331,059,626,525,159,932,938,465,041
6,040,173 to the power 58,039,830,417,527,354,847,616,727,202,092,093
First ten multiples6,040,173, 12,080,346, 18,120,519, 24,160,692, 30,200,865, 36,241,038, 42,281,211, 48,321,384, 54,361,557, 60,401,730
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1258the total stopping time
Highest value reached78,457,62412× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,040,173 → 18,120,520 → 9,060,260 → 4,530,130 → 2,265,065 → 6,795,196 → 3,397,598 → 1,698,799 → 5,096,398 → 2,548,199 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage604,017,300%
6,040,173% as a decimal60,401.73
6,040,173% of 1006,040,173
6,040,173% of 1,00060,401,730
As a fraction of 1006,040,173/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,040,173
Nerdulate something else
Nothing in mind? Surprise me · today’s page