Recognised as Number
1,909,009
- Positive
- Odd
- Composite
- 7 digits
1,909,009 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 value1,909,009
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation1,289 × 1,481
Distinct prime factors21,289, 1,481
Number of divisors4
Sum of divisors σ(n)1,911,780
Aliquot sum2,771sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,906,240integers below n that share no factor with it
Carmichael function λ(n)238,280the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,906,240
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,289, 1,481, 1,909,0094 in total
Arithmetic
Previous number1,909,008
Next number1,909,010
Double3,818,018
Half954,504.5
Square3,644,315,362,081
Cube6,957,030,825,050,887,729
Square root1,381.668918374≈irrational, shown to 9 decimal places
Cube root124.05168241≈
Negation-1,909,009
Reciprocal5.23831999 × 10^-7≈
Representations
Decimal1,909,009
Binary11101001000010001000121 bits
Octal7220421
Hexadecimal1D2111
Base 3614X01
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and nine thousand and nine
Ordinalone million, nine hundred and nine thousand and ninth
Scientific notation1.909009 × 10^6
Engineering notation1.909009 × 10^6
In other bases
Ternary10120222200001base 3; the most digit-efficient integer base after e: 14 digits
Quinary442042014base 5; one hand: 9 digits
Septenary22140424base 7: 8 digits
Nonary3528601base 9; each digit is two ternary digits: 7 digits
Duodecimal780901base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalbica9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal8:50:16:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11TT1000T00001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011010110000100010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111010010000100010001
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes31d 21 11
Gray code100111011000110011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111010010000100010001
64-bit0000000000000000000000000000000000000000000111010010000100010001
One's complement11111111111000101101111011101110at 32 bits, every bit flipped
Bits reversed10001000100001001011100000000000at 32 bits
Rotated left by 100000000001110100100001000100010at 32 bits, wrapping
Shifted left by 11110100100001000100010= 3,818,018, no wrap
Shifted right by 111101001000010001000= 954,504, discarding the low bit
These bits as a double9.43175765 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,909,009 to the power 23,644,315,362,081
1,909,009 to the power 36,957,030,825,050,887,729
1,909,009 to the power 413,281,034,458,299,570,132,650,561
1,909,009 to the power 525,353,614,310,204,004,079,361,114,804,049
First ten multiples1,909,009, 3,818,018, 5,727,027, 7,636,036, 9,545,045, 11,454,054, 13,363,063, 15,272,072, 17,181,081, 19,090,090
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
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 1
Divisible by 9No, remainder 1
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 1101the total stopping time
Highest value reached5,727,0283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,909,009 → 5,727,028 → 2,863,514 → 1,431,757 → 4,295,272 → 2,147,636 → 1,073,818 → 536,909 → 1,610,728 → 805,364 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage190,900,900%
1,909,009% as a decimal19,090.09
1,909,009% of 1001,909,009
1,909,009% of 1,00019,090,090
As a fraction of 1001,909,009/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 1,909,009
Nerdulate something else
Nothing in mind? Surprise me · today’s page