Recognised as Number
3,609,999
- Positive
- Odd
- Composite
- 7 digits
3,609,999 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,609,999
Digit count7
Digit sum45
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 211 × 1,901
Distinct prime factors33, 211, 1,901
Number of divisors12
Sum of divisors σ(n)5,241,912
Aliquot sum1,631,913sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,394,000integers below n that share no factor with it
Carmichael function λ(n)39,900the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,394,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 211, 633, 1,899, 1,901, 5,703, 17,109, 401,111, 1,203,333, 3,609,99912 in total
Arithmetic
Previous number3,609,998
Next number3,610,000
Double7,219,998
Half1,804,999.5
Square13,032,092,780,001
Cube47,045,841,903,710,829,999
Square root1,899.999736842≈irrational, shown to 9 decimal places
Cube root153.403650273≈
Negation-3,609,999
Reciprocal2.77008387 × 10^-7≈
Representations
Decimal3,609,999
Binary110111000101011000111122 bits
Octal15612617
Hexadecimal37158F
Base 3625DHR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and nine thousand, nine hundred and ninety-nine
Ordinalthree million, six hundred and nine thousand, nine hundred and ninety-ninth
Scientific notation3.609999 × 10^6
Engineering notation3.609999 × 10^6
In other bases
Ternary20210101222200base 3; the most digit-efficient integer base after e: 14 digits
Quinary1411004444base 5; one hand: 10 digits
Septenary42453531base 7: 8 digits
Nonary6711880base 9; each digit is two ternary digits: 7 digits
Duodecimal1261153base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12b4jjbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:42:46:39base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T1011T000T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110110101010010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110001010110001111
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
Bytes337 15 8f
Gray code1011001001111101001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110001010110001111
64-bit0000000000000000000000000000000000000000001101110001010110001111
One's complement11111111110010001110101001110000at 32 bits, every bit flipped
Bits reversed11110001101010001110110000000000at 32 bits
Rotated left by 100000000011011100010101100011110at 32 bits, wrapping
Shifted left by 111011100010101100011110= 7,219,998, no wrap
Shifted right by 1110111000101011000111= 1,804,999, discarding the low bit
These bits as a double1.78357649 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,609,999 to the power 213,032,092,780,001
3,609,999 to the power 347,045,841,903,710,829,999
3,609,999 to the power 4169,835,442,226,554,192,585,560,001
3,609,999 to the power 5613,105,776,602,418,408,679,679,018,049,999
First ten multiples3,609,999, 7,219,998, 10,829,997, 14,439,996, 18,049,995, 21,659,994, 25,269,993, 28,879,992, 32,489,991, 36,099,990
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 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 1141the total stopping time
Highest value reached36,551,24810× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,609,999 → 10,829,998 → 5,414,999 → 16,244,998 → 8,122,499 → 24,367,498 → 12,183,749 → 36,551,248 → 18,275,624 → 9,137,812 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage360,999,900%
3,609,999% as a decimal36,099.99
3,609,999% of 1003,609,999
3,609,999% of 1,00036,099,990
As a fraction of 1003,609,999/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,609,999
Nerdulate something else
Nothing in mind? Surprise me · today’s page