Recognised as Number
3,040,909
- Positive
- Odd
- Composite
- 7 digits
3,040,909 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,040,909
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation17 × 178,877
Distinct prime factors217, 178,877
Number of divisors4
Sum of divisors σ(n)3,219,804
Aliquot sum178,895sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,862,016integers below n that share no factor with it
Carmichael function λ(n)715,504the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,862,016
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 17, 178,877, 3,040,9094 in total
Arithmetic
Previous number3,040,908
Next number3,040,910
Double6,081,818
Half1,520,454.5
Square9,247,127,546,281
Cube28,119,673,379,633,809,429
Square root1,743.820231561≈irrational, shown to 9 decimal places
Cube root144.87756609≈
Negation-3,040,909
Reciprocal3.28849038 × 10^-7≈
Representations
Decimal3,040,909
Binary101110011001101000110122 bits
Octal13463215
Hexadecimal2E668D
Base 361T6DP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, forty thousand, nine hundred and nine
Ordinalthree million, forty thousand, nine hundred and ninth
Scientific notation3.040909 × 10^6
Engineering notation3.040909 × 10^6
In other bases
Ternary12201111100021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1234302114base 5; one hand: 10 digits
Septenary34563424base 7: 8 digits
Nonary5644307base 9; each digit is two ternary digits: 7 digits
Duodecimal1027951base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalj0259base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:4:41:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T011111001T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100111011101110011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011100110011010001101
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
Bytes32e 66 8d
Gray code1110010101010111001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011100110011010001101
64-bit0000000000000000000000000000000000000000001011100110011010001101
One's complement11111111110100011001100101110010at 32 bits, every bit flipped
Bits reversed10110001011001100111010000000000at 32 bits
Rotated left by 100000000010111001100110100011010at 32 bits, wrapping
Shifted left by 110111001100110100011010= 6,081,818, no wrap
Shifted right by 1101110011001101000110= 1,520,454, discarding the low bit
These bits as a double1.50240867 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,040,909 to the power 29,247,127,546,281
3,040,909 to the power 328,119,673,379,633,809,429
3,040,909 to the power 485,509,367,857,188,867,796,930,961
3,040,909 to the power 5260,026,206,301,236,342,783,497,531,683,549
First ten multiples3,040,909, 6,081,818, 9,122,727, 12,163,636, 15,204,545, 18,245,454, 21,286,363, 24,327,272, 27,368,181, 30,409,090
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1133the total stopping time
Highest value reached9,875,0323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,040,909 → 9,122,728 → 4,561,364 → 2,280,682 → 1,140,341 → 3,421,024 → 1,710,512 → 855,256 → 427,628 → 213,814 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage304,090,900%
3,040,909% as a decimal30,409.09
3,040,909% of 1003,040,909
3,040,909% of 1,00030,409,090
As a fraction of 1003,040,909/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,040,909
Nerdulate something else
Nothing in mind? Surprise me · today’s page