Recognised as Number
3,004,619
- Positive
- Odd
- Composite
- 7 digits
3,004,619 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,004,619
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation277 × 10,847
Distinct prime factors2277, 10,847
Number of divisors4
Sum of divisors σ(n)3,015,744
Aliquot sum11,125sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,993,496integers below n that share no factor with it
Carmichael function λ(n)1,496,748the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,993,496
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 277, 10,847, 3,004,6194 in total
Arithmetic
Previous number3,004,618
Next number3,004,620
Double6,009,238
Half1,502,309.5
Square9,027,735,335,161
Cube27,124,905,114,996,108,659
Square root1,733.383685166≈irrational, shown to 9 decimal places
Cube root144.298938528≈
Negation-3,004,619
Reciprocal3.328209 × 10^-7≈
Representations
Decimal3,004,619
Binary101101110110001100101122 bits
Octal13354313
Hexadecimal2DD8CB
Base 361SEDN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four thousand, six hundred and nineteen
Ordinalthree million, four thousand, six hundred and nineteenth
Scientific notation3.004619 × 10^6
Engineering notation3.004619 × 10^6
In other bases
Ternary12122122120012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1232121434base 5; one hand: 10 digits
Septenary34352552base 7: 8 digits
Nonary5578505base 9; each digit is two ternary digits: 7 digits
Duodecimal100a94bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalifbajbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:54:36:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T00T00TT01TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100100010100111011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011011101100011001011
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; 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 d8 cb
Gray code1110110011010010101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011011101100011001011
64-bit0000000000000000000000000000000000000000001011011101100011001011
One's complement11111111110100100010011100110100at 32 bits, every bit flipped
Bits reversed11010011000110111011010000000000at 32 bits
Rotated left by 100000000010110111011000110010110at 32 bits, wrapping
Shifted left by 110110111011000110010110= 6,009,238, no wrap
Shifted right by 1101101110110001100101= 1,502,309, discarding the low bit
These bits as a double1.48447903 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,004,619 to the power 29,027,735,335,161
3,004,619 to the power 327,124,905,114,996,108,659
3,004,619 to the power 481,500,005,281,714,493,002,895,921
3,004,619 to the power 5244,876,464,369,539,718,251,868,139,259,099
First ten multiples3,004,619, 6,009,238, 9,013,857, 12,018,476, 15,023,095, 18,027,714, 21,032,333, 24,036,952, 27,041,571, 30,046,190
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 19
Collatz (3n + 1) trajectory
Steps to reach 1112the total stopping time
Highest value reached13,520,7884× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,004,619 → 9,013,858 → 4,506,929 → 13,520,788 → 6,760,394 → 3,380,197 → 10,140,592 → 5,070,296 → 2,535,148 → 1,267,574 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage300,461,900%
3,004,619% as a decimal30,046.19
3,004,619% of 1003,004,619
3,004,619% of 1,00030,046,190
As a fraction of 1003,004,619/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,004,619
Nerdulate something else
Nothing in mind? Surprise me · today’s page