Recognised as Number
8,971,264
- Positive
- Even
- Composite
- 7 digits
8,971,264 is an even 7-digit integer and a composite number. It has 22 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value8,971,264
Digit count7
Digit sum37
Digit product24,192
Multiplicative persistence4times 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 factorisation2^10 × 8,761
Distinct prime factors22, 8,761
Number of divisors22
Sum of divisors σ(n)17,935,814
Aliquot sum8,964,550sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,485,120integers below n that share no factor with it
Carmichael function λ(n)280,320the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,485,120
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1,024, 8,761, 17,522, 35,044, 70,088, 140,176, 280,352, 560,704, 1,121,408, 2,242,816, 4,485,632, 8,971,26422 in total
Arithmetic
Previous number8,971,263
Next number8,971,265
Double17,942,528
Half4,485,632
Square80,483,577,757,696
Cube722,039,423,728,818,847,744
Square root2,995.206837599≈irrational, shown to 9 decimal places
Cube root207.786763719≈
Negation-8,971,264
Reciprocal1.11467013 × 10^-7≈
Representations
Decimal8,971,264
Binary10001000111001000000000024 bits
Octal42162000
Hexadecimal88E400
Base 365CA9S
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, nine hundred and seventy-one thousand, two hundred and sixty-four
Ordinaleight million, nine hundred and seventy-one thousand, two hundred and sixty-fourth
Scientific notation8.971264 × 10^6
Engineering notation8.971264 × 10^6
In other bases
Ternary121212210021001base 3; the most digit-efficient integer base after e: 15 digits
Quinary4244040024base 5; one hand: 10 digits
Septenary136153201base 7: 9 digits
Nonary17783231base 9; each digit is two ternary digits: 8 digits
Duodecimal3007854base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2g1834base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:32:1:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T0T0T101T1001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100110010010010000000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010001110010000000000
Bit length24 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits18within that length
Bit parityeven6 set bits, so even; not the same as the number itself being even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 1010 trailing zeros
Power of twoNo
Bytes388 e4 00
Gray code110011001001011000000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010001110010000000000
64-bit0000000000000000000000000000000000000000100010001110010000000000
One's complement11111111011101110001101111111111at 32 bits, every bit flipped
Bits reversed00000000001001110001000100000000at 32 bits
Rotated left by 100000001000100011100100000000000at 32 bits, wrapping
Shifted left by 11000100011100100000000000= 17,942,528, no wrap
Shifted right by 110001000111001000000000= 4,485,632, discarding the low bit
These bits as a double4.43239334 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,971,264 to the power 280,483,577,757,696
8,971,264 to the power 3722,039,423,728,818,847,744
8,971,264 to the power 46,477,606,288,679,098,291,287,228,416
8,971,264 to the power 558,112,316,103,800,402,053,086,625,948,237,824
First ten multiples8,971,264, 17,942,528, 26,913,792, 35,885,056, 44,856,320, 53,827,584, 62,798,848, 71,770,112, 80,741,376, 89,712,640
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10No, remainder 4
Divisible by 11No, remainder 5
Divisible by 12No, remainder 4
Divisible by 100No, remainder 64
Collatz (3n + 1) trajectory
Steps to reach 175the total stopping time
Highest value reached8,971,264
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,971,264 → 4,485,632 → 2,242,816 → 1,121,408 → 560,704 → 280,352 → 140,176 → 70,088 → 35,044 → 17,522 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage897,126,400%
8,971,264% as a decimal89,712.64
8,971,264% of 1008,971,264
8,971,264% of 1,00089,712,640
As a fraction of 1008,971,264/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,971,264
Nerdulate something else
Nothing in mind? Surprise me · today’s page