Recognised as Number
7,805,009
- Positive
- Odd
- Prime
- 7 digits
7,805,009 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,805,009
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,805,009
Distinct prime factors17,805,009
Number of divisors2
Sum of divisors σ(n)7,805,010
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,805,008integers below n that share no factor with it
Carmichael function λ(n)7,805,008the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7,805,0092 in total
Arithmetic
Previous number7,805,008
Next number7,805,010
Double15,610,018
Half3,902,504.5
Square60,918,165,490,081
Cube475,466,829,913,571,615,729
Square root2,793.744619682≈irrational, shown to 9 decimal places
Cube root198.361691368≈
Negation-7,805,009
Reciprocal1.2812285 × 10^-7≈
Representations
Decimal7,805,009
Binary1110111000110000101000123 bits
Octal35614121
Hexadecimal771851
Base 364NADT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, eight hundred and five thousand and nine
Ordinalseven million, eight hundred and five thousand and ninth
Scientific notation7.805009 × 10^6
Engineering notation7.805009 × 10^6
In other bases
Ternary112200112110102base 3; the most digit-efficient integer base after e: 15 digits
Quinary3444230014base 5; one hand: 10 digits
Septenary123225062base 7: 9 digits
Nonary15615412base 9; each digit is two ternary digits: 8 digits
Duodecimal2744955base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal28fca9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal36:8:3:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT0T01TTT11011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100010110110100001010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011101110001100001010001
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes377 18 51
Gray code10011001001010001111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011101110001100001010001
64-bit0000000000000000000000000000000000000000011101110001100001010001
One's complement11111111100010001110011110101110at 32 bits, every bit flipped
Bits reversed10001010000110001110111000000000at 32 bits
Rotated left by 100000000111011100011000010100010at 32 bits, wrapping
Shifted left by 1111011100011000010100010= 15,610,018, no wrap
Shifted right by 11110111000110000101000= 3,902,504, discarding the low bit
These bits as a double3.85618681 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,805,009 to the power 260,918,165,490,081
7,805,009 to the power 3475,466,829,913,571,615,729
7,805,009 to the power 43,711,022,886,676,895,682,909,386,561
7,805,009 to the power 528,964,567,029,719,150,897,168,908,293,084,049
First ten multiples7,805,009, 15,610,018, 23,415,027, 31,220,036, 39,025,045, 46,830,054, 54,635,063, 62,440,072, 70,245,081, 78,050,090
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached23,415,0283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,805,009 → 23,415,028 → 11,707,514 → 5,853,757 → 17,561,272 → 8,780,636 → 4,390,318 → 2,195,159 → 6,585,478 → 3,292,739 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage780,500,900%
7,805,009% as a decimal78,050.09
7,805,009% of 1007,805,009
7,805,009% of 1,00078,050,090
As a fraction of 1007,805,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 7,805,009
Nerdulate something else
Nothing in mind? Surprise me · today’s page