Recognised as Number
3,005,583
- Positive
- Odd
- Composite
- 7 digits
3,005,583 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,005,583
Digit count7
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 7 × 17 × 8,419
Distinct prime factors43, 7, 17, 8,419
Number of divisors16
Sum of divisors σ(n)4,849,920
Aliquot sum1,844,337sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,616,256integers below n that share no factor with it
Carmichael function λ(n)67,344the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,616,256
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 17, 21, 51, 119, 357, 8,419, 25,257, 58,933, 143,123, 176,799, 429,369, 1,001,861, 3,005,58316 in total
Arithmetic
Previous number3,005,582
Next number3,005,584
Double6,011,166
Half1,502,791.5
Square9,033,529,169,889
Cube27,151,021,703,022,490,287
Square root1,733.661731711≈irrational, shown to 9 decimal places
Cube root144.314369137≈
Negation-3,005,583
Reciprocal3.32714152 × 10^-7≈
Representations
Decimal3,005,583
Binary101101110111001000111122 bits
Octal13356217
Hexadecimal2DDC8F
Base 361SF4F
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five thousand, five hundred and eighty-three
Ordinalthree million, five thousand, five hundred and eighty-third
Scientific notation3.005583 × 10^6
Engineering notation3.005583 × 10^6
In other bases
Ternary12122200212220base 3; the most digit-efficient integer base after e: 14 digits
Quinary1232134313base 5; one hand: 10 digits
Septenary34355430base 7: 8 digits
Nonary5580786base 9; each digit is two ternary digits: 7 digits
Duodecimal100b413base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalifdj3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:54:53:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T00T010T00T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100100010110110010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011011101110010001111
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 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
Bytes32d dc 8f
Gray code1110110011001011001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011011101110010001111
64-bit0000000000000000000000000000000000000000001011011101110010001111
One's complement11111111110100100010001101110000at 32 bits, every bit flipped
Bits reversed11110001001110111011010000000000at 32 bits
Rotated left by 100000000010110111011100100011110at 32 bits, wrapping
Shifted left by 110110111011100100011110= 6,011,166, no wrap
Shifted right by 1101101110111001000111= 1,502,791, discarding the low bit
These bits as a double1.48495531 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,005,583 to the power 29,033,529,169,889
3,005,583 to the power 327,151,021,703,022,490,287
3,005,583 to the power 481,604,649,263,235,445,424,272,321
3,005,583 to the power 5245,269,546,546,542,979,764,620,675,368,143
First ten multiples3,005,583, 6,011,166, 9,016,749, 12,022,332, 15,027,915, 18,033,498, 21,039,081, 24,044,664, 27,050,247, 30,055,830
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 3
Divisible by 100No, remainder 83
Collatz (3n + 1) trajectory
Steps to reach 189the total stopping time
Highest value reached30,431,53610× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,005,583 → 9,016,750 → 4,508,375 → 13,525,126 → 6,762,563 → 20,287,690 → 10,143,845 → 30,431,536 → 15,215,768 → 7,607,884 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage300,558,300%
3,005,583% as a decimal30,055.83
3,005,583% of 1003,005,583
3,005,583% of 1,00030,055,830
As a fraction of 1003,005,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,005,583
Nerdulate something else
Nothing in mind? Surprise me · today’s page