Recognised as Number
9,076,967
- Positive
- Odd
- Prime
- 7 digits
9,076,967 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,076,967
Digit count7
Digit sum44
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,076,967
Distinct prime factors19,076,967
Number of divisors2
Sum of divisors σ(n)9,076,968
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,076,966integers below n that share no factor with it
Carmichael function λ(n)9,076,966the 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, 9,076,9672 in total
Arithmetic
Previous number9,076,966
Next number9,076,968
Double18,153,934
Half4,538,483.5
Square82,391,329,919,089
Cube747,863,382,761,683,523,063
Square root3,012.800524429≈irrational, shown to 9 decimal places
Cube root208.599654853≈
Negation-9,076,967
Reciprocal1.10168958 × 10^-7≈
Representations
Decimal9,076,967
Binary10001010100000001110011124 bits
Octal42500347
Hexadecimal8A80E7
Base 365EJTZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, seventy-six thousand, nine hundred and sixty-seven
Ordinalnine million, seventy-six thousand, nine hundred and sixty-seventh
Scientific notation9.076967 × 10^6
Engineering notation9.076967 × 10^6
In other bases
Ternary122002011020222base 3; the most digit-efficient integer base after e: 15 digits
Quinary4310430332base 5; one hand: 10 digits
Septenary140103314base 7: 9 digits
Nonary18064228base 9; each digit is two ternary digits: 8 digits
Duodecimal3058a5bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2gec87base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal42:1:22:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T01T0111T100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111111000000100111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010101000000011100111
Bit length24 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits14within that length
Bit parityeven10 set bits, so even; 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
Bytes38a 80 e7
Gray code110011111100000010010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010101000000011100111
64-bit0000000000000000000000000000000000000000100010101000000011100111
One's complement11111111011101010111111100011000at 32 bits, every bit flipped
Bits reversed11100111000000010101000100000000at 32 bits
Rotated left by 100000001000101010000000111001110at 32 bits, wrapping
Shifted left by 11000101010000000111001110= 18,153,934, no wrap
Shifted right by 110001010100000001110011= 4,538,483, discarding the low bit
These bits as a double4.48461756 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,076,967 to the power 282,391,329,919,089
9,076,967 to the power 3747,863,382,761,683,523,063
9,076,967 to the power 46,788,331,245,836,170,203,286,589,921
9,076,967 to the power 561,617,458,703,523,804,341,615,668,255,449,607
First ten multiples9,076,967, 18,153,934, 27,230,901, 36,307,868, 45,384,835, 54,461,802, 63,538,769, 72,615,736, 81,692,703, 90,769,670
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1225the total stopping time
Highest value reached103,392,34011× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,076,967 → 27,230,902 → 13,615,451 → 40,846,354 → 20,423,177 → 61,269,532 → 30,634,766 → 15,317,383 → 45,952,150 → 22,976,075 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage907,696,700%
9,076,967% as a decimal90,769.67
9,076,967% of 1009,076,967
9,076,967% of 1,00090,769,670
As a fraction of 1009,076,967/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 9,076,967
Nerdulate something else
Nothing in mind? Surprise me · today’s page