Recognised as Number
8,970,001
- Positive
- Odd
- Composite
- 7 digits
8,970,001 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value8,970,001
Digit count7
Digit sum25
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 factorisation197 × 45,533
Distinct prime factors2197, 45,533
Number of divisors4
Sum of divisors σ(n)9,015,732
Aliquot sum45,731sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,924,272integers below n that share no factor with it
Carmichael function λ(n)2,231,068the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,924,272
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 197, 45,533, 8,970,0014 in total
Arithmetic
Previous number8,970,000
Next number8,970,002
Double17,940,002
Half4,485,000.5
Square80,460,917,940,001
Cube721,734,514,382,726,910,001
Square root2,994.99599332≈irrational, shown to 9 decimal places
Cube root207.777012325≈
Negation-8,970,001
Reciprocal1.11482708 × 10^-7≈
Representations
Decimal8,970,001
Binary10001000110111110001000124 bits
Octal42157421
Hexadecimal88DF11
Base 365C9AP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, nine hundred and seventy thousand and one
Ordinaleight million, nine hundred and seventy thousand and first
Scientific notation8.970001 × 10^6
Engineering notation8.970001 × 10^6
In other bases
Ternary121212201112021base 3; the most digit-efficient integer base after e: 15 digits
Quinary4244020001base 5; one hand: 10 digits
Septenary136146415base 7: 9 digits
Nonary17781467base 9; each digit is two ternary digits: 8 digits
Duodecimal3006b81base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2g1501base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:31:40:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T0T0T1TTTT1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100110010010001100010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010001101111100010001
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
Bytes388 df 11
Gray code110011001011000010011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010001101111100010001
64-bit0000000000000000000000000000000000000000100010001101111100010001
One's complement11111111011101110010000011101110at 32 bits, every bit flipped
Bits reversed10001000111110110001000100000000at 32 bits
Rotated left by 100000001000100011011111000100010at 32 bits, wrapping
Shifted left by 11000100011011111000100010= 17,940,002, no wrap
Shifted right by 110001000110111110001000= 4,485,000, discarding the low bit
These bits as a double4.43176934 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,970,001 to the power 280,460,917,940,001
8,970,001 to the power 3721,734,514,382,726,910,001
8,970,001 to the power 46,473,959,315,747,574,765,435,880,001
8,970,001 to the power 558,071,421,536,215,061,393,534,609,044,850,001
First ten multiples8,970,001, 17,940,002, 26,910,003, 35,880,004, 44,850,005, 53,820,006, 62,790,007, 71,760,008, 80,730,009, 89,700,010
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 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1212the total stopping time
Highest value reached26,910,0043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,970,001 → 26,910,004 → 13,455,002 → 6,727,501 → 20,182,504 → 10,091,252 → 5,045,626 → 2,522,813 → 7,568,440 → 3,784,220 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage897,000,100%
8,970,001% as a decimal89,700.01
8,970,001% of 1008,970,001
8,970,001% of 1,00089,700,010
As a fraction of 1008,970,001/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,970,001
Nerdulate something else
Nothing in mind? Surprise me · today’s page