Recognised as Number
9,095,317
- Positive
- Odd
- Composite
- 7 digits
9,095,317 is an odd 7-digit integer and a composite number. It has 32 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value9,095,317
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 factorisation7 × 11 × 41 × 43 × 67
Distinct prime factors57, 11, 41, 43, 67
Number of divisors32
Sum of divisors σ(n)12,063,744
Aliquot sum2,968,427sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,652,800integers below n that share no factor with it
Carmichael function λ(n)9,240the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,652,800
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 11, 41, 43, 67, 77, 287, 301, 451, 469, 473, 737, 1,763, 2,747, 2,881, 3,157, 3,311, 5,159, 12,341, 19,229, 19,393, 20,167, 30,217, 31,691, 118,121, 135,751, 211,519, 221,837, 826,847, 1,299,331, 9,095,31732 in total
Arithmetic
Previous number9,095,316
Next number9,095,318
Double18,190,634
Half4,547,658.5
Square82,724,791,330,489
Cube752,408,200,909,649,220,013
Square root3,015.844326221≈irrational, shown to 9 decimal places
Cube root208.740128616≈
Negation-9,095,317
Reciprocal1.0994669 × 10^-7≈
Representations
Decimal9,095,317
Binary10001010110010001001010124 bits
Octal42544225
Hexadecimal8AC895
Base 365EXZP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, ninety-five thousand, three hundred and seventeen
Ordinalnine million, ninety-five thousand, three hundred and seventeenth
Scientific notation9.095317 × 10^6
Engineering notation9.095317 × 10^6
In other bases
Ternary122010002102121base 3; the most digit-efficient integer base after e: 15 digits
Quinary4312022232base 5; one hand: 10 digits
Septenary140210650base 7: 9 digits
Nonary18102377base 9; each digit is two ternary digits: 8 digits
Duodecimal30675b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2ggi5hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal42:6:28:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T01001T110TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111111101100110010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010101100100010010101
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 c8 95
Gray code110011111010110011011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010101100100010010101
64-bit0000000000000000000000000000000000000000100010101100100010010101
One's complement11111111011101010011011101101010at 32 bits, every bit flipped
Bits reversed10101001000100110101000100000000at 32 bits
Rotated left by 100000001000101011001000100101010at 32 bits, wrapping
Shifted left by 11000101011001000100101010= 18,190,634, no wrap
Shifted right by 110001010110010001001010= 4,547,658, discarding the low bit
These bits as a double4.49368367 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,095,317 to the power 282,724,791,330,489
9,095,317 to the power 3752,408,200,909,649,220,013
9,095,317 to the power 46,843,391,100,672,948,014,820,979,121
9,095,317 to the power 562,242,811,415,599,375,519,317,503,355,876,357
First ten multiples9,095,317, 18,190,634, 27,285,951, 36,381,268, 45,476,585, 54,571,902, 63,667,219, 72,762,536, 81,857,853, 90,953,170
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 2
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11Yes
Divisible by 12No, remainder 1
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 1212the total stopping time
Highest value reached27,285,9523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,095,317 → 27,285,952 → 13,642,976 → 6,821,488 → 3,410,744 → 1,705,372 → 852,686 → 426,343 → 1,279,030 → 639,515 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage909,531,700%
9,095,317% as a decimal90,953.17
9,095,317% of 1009,095,317
9,095,317% of 1,00090,953,170
As a fraction of 1009,095,317/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,095,317
Nerdulate something else
Nothing in mind? Surprise me · today’s page