Recognised as Number
6,733,189
- Positive
- Odd
- Composite
- 7 digits
6,733,189 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value6,733,189
Digit count7
Digit sum37
Digit product27,216
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation107 × 62,927
Distinct prime factors2107, 62,927
Number of divisors4
Sum of divisors σ(n)6,796,224
Aliquot sum63,035sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,670,156integers below n that share no factor with it
Carmichael function λ(n)3,335,078the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,670,156
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 107, 62,927, 6,733,1894 in total
Arithmetic
Previous number6,733,188
Next number6,733,190
Double13,466,378
Half3,366,594.5
Square45,335,834,109,721
Cube305,254,739,533,398,230,269
Square root2,594.838916002≈irrational, shown to 9 decimal places
Cube root188.83113422≈
Negation-6,733,189
Reciprocal1.48518035 × 10^-7≈
Representations
Decimal6,733,189
Binary1100110101111011000010123 bits
Octal31536605
Hexadecimal66BD85
Base 3640BD1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, seven hundred and thirty-three thousand, one hundred and eighty-nine
Ordinalsix million, seven hundred and thirty-three thousand, one hundred and eighty-ninth
Scientific notation6.733189 × 10^6
Engineering notation6.733189 × 10^6
In other bases
Ternary110200002012101base 3; the most digit-efficient integer base after e: 15 digits
Quinary3210430224base 5; one hand: 10 digits
Septenary111142201base 7: 9 digits
Nonary13602171base 9; each digit is two ternary digits: 8 digits
Duodecimal2308631base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal221cj9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:10:19:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T0001T1TT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110111100001010000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011001101011110110000101
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 bd 85
Gray code10101011110001101000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011001101011110110000101
64-bit0000000000000000000000000000000000000000011001101011110110000101
One's complement11111111100110010100001001111010at 32 bits, every bit flipped
Bits reversed10100001101111010110011000000000at 32 bits
Rotated left by 100000000110011010111101100001010at 32 bits, wrapping
Shifted left by 1110011010111101100001010= 13,466,378, no wrap
Shifted right by 11100110101111011000010= 3,366,594, discarding the low bit
These bits as a double3.32663737 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,733,189 to the power 245,335,834,109,721
6,733,189 to the power 3305,254,739,533,398,230,269
6,733,189 to the power 42,055,337,854,424,142,096,666,697,841
6,733,189 to the power 513,838,978,232,692,234,899,713,146,569,344,949
First ten multiples6,733,189, 13,466,378, 20,199,567, 26,932,756, 33,665,945, 40,399,134, 47,132,323, 53,865,512, 60,598,701, 67,331,890
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1160the total stopping time
Highest value reached43,729,7926× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,733,189 → 20,199,568 → 10,099,784 → 5,049,892 → 2,524,946 → 1,262,473 → 3,787,420 → 1,893,710 → 946,855 → 2,840,566 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage673,318,900%
6,733,189% as a decimal67,331.89
6,733,189% of 1006,733,189
6,733,189% of 1,00067,331,890
As a fraction of 1006,733,189/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,733,189
Nerdulate something else
Nothing in mind? Surprise me · today’s page