Recognised as Number
9,826,291
- Positive
- Odd
- Prime
- 7 digits
9,826,291 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,826,291
Digit count7
Digit sum37
Digit product15,552
Multiplicative persistence3times 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 factorisation9,826,291
Distinct prime factors19,826,291
Number of divisors2
Sum of divisors σ(n)9,826,292
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,826,290integers below n that share no factor with it
Carmichael function λ(n)9,826,290the 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,826,2912 in total
Arithmetic
Previous number9,826,290
Next number9,826,292
Double19,652,582
Half4,913,145.5
Square96,555,994,816,681
Cube948,787,302,863,199,160,171
Square root3,134.691531874≈irrational, shown to 9 decimal places
Cube root214.188692862≈
Negation-9,826,291
Reciprocal1.01767798 × 10^-7≈
Representations
Decimal9,826,291
Binary10010101111011111111001124 bits
Octal45367763
Hexadecimal95EFF3
Base 365UM0J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, eight hundred and twenty-six thousand, two hundred and ninety-one
Ordinalnine million, eight hundred and twenty-six thousand, two hundred and ninety-first
Scientific notation9.826291 × 10^6
Engineering notation9.826291 × 10^6
In other bases
Ternary200111020010201base 3; the most digit-efficient integer base after e: 15 digits
Quinary10003420131base 5; one hand: 11 digits
Septenary146344036base 7: 9 digits
Nonary20436121base 9; each digit is two ternary digits: 8 digits
Duodecimal335a617base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal3185ebbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal45:29:31:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001111T0011T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010100011000000110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100101011110111111110011
Bit length24 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits7within that length
Bit parityodd17 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
Bytes395 ef f3
Gray code110111110001100000001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100101011110111111110011
64-bit0000000000000000000000000000000000000000100101011110111111110011
One's complement11111111011010100001000000001100at 32 bits, every bit flipped
Bits reversed11001111111101111010100100000000at 32 bits
Rotated left by 100000001001010111101111111100110at 32 bits, wrapping
Shifted left by 11001010111101111111100110= 19,652,582, no wrap
Shifted right by 110010101111011111111001= 4,913,145, discarding the low bit
These bits as a double4.85483281 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,826,291 to the power 296,555,994,816,681
9,826,291 to the power 3948,787,302,863,199,160,171
9,826,291 to the power 49,323,060,135,038,928,138,795,855,761
9,826,291 to the power 591,611,101,897,391,804,219,896,468,301,612,451
First ten multiples9,826,291, 19,652,582, 29,478,873, 39,305,164, 49,131,455, 58,957,746, 68,784,037, 78,610,328, 88,436,619, 98,262,910
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1145the total stopping time
Highest value reached44,218,3124× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,826,291 → 29,478,874 → 14,739,437 → 44,218,312 → 22,109,156 → 11,054,578 → 5,527,289 → 16,581,868 → 8,290,934 → 4,145,467 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage982,629,100%
9,826,291% as a decimal98,262.91
9,826,291% of 1009,826,291
9,826,291% of 1,00098,262,910
As a fraction of 1009,826,291/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,826,291
Nerdulate something else
Nothing in mind? Surprise me · today’s page