Recognised as Number
8,980,405
- Positive
- Odd
- Composite
- 7 digits
8,980,405 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value8,980,405
Digit count7
Digit sum34
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 factorisation5 × 7 × 379 × 677
Distinct prime factors45, 7, 379, 677
Number of divisors16
Sum of divisors σ(n)12,366,720
Aliquot sum3,386,315sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,132,672integers below n that share no factor with it
Carmichael function λ(n)127,764the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,132,672
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 7, 35, 379, 677, 1,895, 2,653, 3,385, 4,739, 13,265, 23,695, 256,583, 1,282,915, 1,796,081, 8,980,40516 in total
Arithmetic
Previous number8,980,404
Next number8,980,406
Double17,960,810
Half4,490,202.5
Square80,647,673,964,025
Cube724,248,774,504,899,930,125
Square root2,996.732387118≈irrational, shown to 9 decimal places
Cube root207.857312457≈
Negation-8,980,405
Reciprocal1.11353553 × 10^-7≈
Representations
Decimal8,980,405
Binary10001001000001111011010124 bits
Octal42203665
Hexadecimal8907B5
Base 365CHBP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, nine hundred and eighty thousand, four hundred and five
Ordinaleight million, nine hundred and eighty thousand, four hundred and fifth
Scientific notation8.980405 × 10^6
Engineering notation8.980405 × 10^6
In other bases
Ternary121220020210121base 3; the most digit-efficient integer base after e: 15 digits
Quinary4244333110base 5; one hand: 10 digits
Septenary136221640base 7: 9 digits
Nonary17806717base 9; each digit is two ternary digits: 8 digits
Duodecimal3010bb1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2g2b05base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:34:33:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T0T01T1T11TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100110010001100011110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010010000011110110101
Bit length24 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits13within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes389 07 b5
Gray code110011011000010001101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010010000011110110101
64-bit0000000000000000000000000000000000000000100010010000011110110101
One's complement11111111011101101111100001001010at 32 bits, every bit flipped
Bits reversed10101101111000001001000100000000at 32 bits
Rotated left by 100000001000100100000111101101010at 32 bits, wrapping
Shifted left by 11000100100000111101101010= 17,960,810, no wrap
Shifted right by 110001001000001111011010= 4,490,202, discarding the low bit
These bits as a double4.4369096 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,980,405 to the power 280,647,673,964,025
8,980,405 to the power 3724,248,774,504,899,930,125
8,980,405 to the power 46,504,047,315,807,675,856,994,200,625
8,980,405 to the power 558,408,979,035,115,831,304,530,004,263,753,125
First ten multiples8,980,405, 17,960,810, 26,941,215, 35,921,620, 44,902,025, 53,882,430, 62,862,835, 71,843,240, 80,823,645, 89,804,050
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 5
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 5
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached26,941,2163× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,980,405 → 26,941,216 → 13,470,608 → 6,735,304 → 3,367,652 → 1,683,826 → 841,913 → 2,525,740 → 1,262,870 → 631,435 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage898,040,500%
8,980,405% as a decimal89,804.05
8,980,405% of 1008,980,405
8,980,405% of 1,00089,804,050
As a fraction of 1008,980,405/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 8,980,405
Nerdulate something else
Nothing in mind? Surprise me · today’s page