Recognised as Number
9,829,373
- Positive
- Odd
- Prime
- 7 digits
9,829,373 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,829,373
Digit count7
Digit sum41
Digit product81,648
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,829,373
Distinct prime factors19,829,373
Number of divisors2
Sum of divisors σ(n)9,829,374
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,829,372integers below n that share no factor with it
Carmichael function λ(n)9,829,372the 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,829,3732 in total
Arithmetic
Previous number9,829,372
Next number9,829,374
Double19,658,746
Half4,914,686.5
Square96,616,573,573,129
Cube949,680,339,632,227,718,117
Square root3,135.183088753≈irrational, shown to 9 decimal places
Cube root214.211083831≈
Negation-9,829,373
Reciprocal1.01735889 × 10^-7≈
Representations
Decimal9,829,373
Binary10010101111110111111110124 bits
Octal45375775
Hexadecimal95FBFD
Base 365UOE5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, eight hundred and twenty-nine thousand, three hundred and seventy-three
Ordinalnine million, eight hundred and twenty-nine thousand, three hundred and seventy-third
Scientific notation9.829373 × 10^6
Engineering notation9.829373 × 10^6
In other bases
Ternary200111101100212base 3; the most digit-efficient integer base after e: 15 digits
Quinary10004014443base 5; one hand: 11 digits
Septenary146356031base 7: 9 digits
Nonary20441325base 9; each digit is two ternary digits: 8 digits
Duodecimal3360365base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal318d8dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal45:30:22:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001111011010TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010100000110000001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100101011111101111111101
Bit length24 bitsto write the magnitude
Set bits18the population count, or Hamming weight
Zero bits6within that length
Bit parityeven18 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
Bytes395 fb fd
Gray code110111110000011000000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100101011111101111111101
64-bit0000000000000000000000000000000000000000100101011111101111111101
One's complement11111111011010100000010000000010at 32 bits, every bit flipped
Bits reversed10111111110111111010100100000000at 32 bits
Rotated left by 100000001001010111111011111111010at 32 bits, wrapping
Shifted left by 11001010111111011111111010= 19,658,746, no wrap
Shifted right by 110010101111110111111110= 4,914,686, discarding the low bit
These bits as a double4.85635552 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,829,373 to the power 296,616,573,573,129
9,829,373 to the power 3949,680,339,632,227,718,117
9,829,373 to the power 49,334,762,289,011,849,062,310,850,641
9,829,373 to the power 591,754,860,405,031,265,853,153,592,897,678,093
First ten multiples9,829,373, 19,658,746, 29,488,119, 39,317,492, 49,146,865, 58,976,238, 68,805,611, 78,634,984, 88,464,357, 98,293,730
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1220the total stopping time
Highest value reached538,027,97254× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,829,373 → 29,488,120 → 14,744,060 → 7,372,030 → 3,686,015 → 11,058,046 → 5,529,023 → 16,587,070 → 8,293,535 → 24,880,606 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage982,937,300%
9,829,373% as a decimal98,293.73
9,829,373% of 1009,829,373
9,829,373% of 1,00098,293,730
As a fraction of 1009,829,373/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,829,373
Nerdulate something else
Nothing in mind? Surprise me · today’s page