Recognised as Number
3,349,583
- Positive
- Odd
- Composite
- 7 digits
3,349,583 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,349,583
Digit count7
Digit sum35
Digit product38,880
Multiplicative persistence2times 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 factorisation229 × 14,627
Distinct prime factors2229, 14,627
Number of divisors4
Sum of divisors σ(n)3,364,440
Aliquot sum14,857sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,334,728integers below n that share no factor with it
Carmichael function λ(n)1,667,364the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,334,728
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 229, 14,627, 3,349,5834 in total
Arithmetic
Previous number3,349,582
Next number3,349,584
Double6,699,166
Half1,674,791.5
Square11,219,706,273,889
Cube37,581,337,400,011,938,287
Square root1,830.186602508≈irrational, shown to 9 decimal places
Cube root149.62250262≈
Negation-3,349,583
Reciprocal2.98544625 × 10^-7≈
Representations
Decimal3,349,583
Binary110011000111000100111122 bits
Octal14616117
Hexadecimal331C4F
Base 361ZSJZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and forty-nine thousand, five hundred and eighty-three
Ordinalthree million, three hundred and forty-nine thousand, five hundred and eighty-third
Scientific notation3.349583 × 10^6
Engineering notation3.349583 × 10^6
In other bases
Ternary20022011202122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1324141313base 5; one hand: 10 digits
Septenary40320356base 7: 8 digits
Nonary6264678base 9; each digit is two ternary digits: 7 digits
Duodecimal11564bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10idj3base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:30:26:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010T1TTT10T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110110110001010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110001110001001111
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes333 1c 4f
Gray code1010101001001001101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110001110001001111
64-bit0000000000000000000000000000000000000000001100110001110001001111
One's complement11111111110011001110001110110000at 32 bits, every bit flipped
Bits reversed11110010001110001100110000000000at 32 bits
Rotated left by 100000000011001100011100010011110at 32 bits, wrapping
Shifted left by 111001100011100010011110= 6,699,166, no wrap
Shifted right by 1110011000111000100111= 1,674,791, discarding the low bit
These bits as a double1.65491389 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,349,583 to the power 211,219,706,273,889
3,349,583 to the power 337,581,337,400,011,938,287
3,349,583 to the power 4125,881,808,872,344,188,283,184,321
3,349,583 to the power 5421,651,567,008,053,263,222,153,387,488,143
First ten multiples3,349,583, 6,699,166, 10,048,749, 13,398,332, 16,747,915, 20,097,498, 23,447,081, 26,796,664, 30,146,247, 33,495,830
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 83
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached33,914,53610× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,349,583 → 10,048,750 → 5,024,375 → 15,073,126 → 7,536,563 → 22,609,690 → 11,304,845 → 33,914,536 → 16,957,268 → 8,478,634 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage334,958,300%
3,349,583% as a decimal33,495.83
3,349,583% of 1003,349,583
3,349,583% of 1,00033,495,830
As a fraction of 1003,349,583/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 3,349,583
Nerdulate something else
Nothing in mind? Surprise me · today’s page