Recognised as Number
9,638,437
- Positive
- Odd
- Prime
- 7 digits
9,638,437 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,638,437
Digit count7
Digit sum40
Digit product108,864
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,638,437
Distinct prime factors19,638,437
Number of divisors2
Sum of divisors σ(n)9,638,438
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,638,436integers below n that share no factor with it
Carmichael function λ(n)9,638,436the 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,638,4372 in total
Arithmetic
Previous number9,638,436
Next number9,638,438
Double19,276,874
Half4,819,218.5
Square92,899,467,802,969
Cube895,405,667,752,445,119,453
Square root3,104.583224847≈irrational, shown to 9 decimal places
Cube root212.814984776≈
Negation-9,638,437
Reciprocal1.03751262 × 10^-7≈
Representations
Decimal9,638,437
Binary10010011000100100010010124 bits
Octal44611045
Hexadecimal931225
Base 365QL2D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, six hundred and thirty-eight thousand, four hundred and thirty-seven
Ordinalnine million, six hundred and thirty-eight thousand, four hundred and thirty-seventh
Scientific notation9.638437 × 10^6
Engineering notation9.638437 × 10^6
In other bases
Ternary200010200110011base 3; the most digit-efficient integer base after e: 15 digits
Quinary4431412222base 5; one hand: 10 digits
Septenary144632254base 7: 9 digits
Nonary20120404base 9; each digit is two ternary digits: 8 digits
Duodecimal3289971base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal304g1hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal44:37:20:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00011T00110011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100101110001011001100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100100110001001000100101
Bit length24 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits15within that length
Bit parityodd9 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
Bytes393 12 25
Gray code110110101001101100110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100100110001001000100101
64-bit0000000000000000000000000000000000000000100100110001001000100101
One's complement11111111011011001110110111011010at 32 bits, every bit flipped
Bits reversed10100100010010001100100100000000at 32 bits
Rotated left by 100000001001001100010010001001010at 32 bits, wrapping
Shifted left by 11001001100010010001001010= 19,276,874, no wrap
Shifted right by 110010011000100100010010= 4,819,218, discarding the low bit
These bits as a double4.7620206 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,638,437 to the power 292,899,467,802,969
9,638,437 to the power 3895,405,667,752,445,119,453
9,638,437 to the power 48,630,311,118,074,873,879,805,214,961
9,638,437 to the power 583,182,710,001,964,233,173,448,136,673,055,957
First ten multiples9,638,437, 19,276,874, 28,915,311, 38,553,748, 48,192,185, 57,830,622, 67,469,059, 77,107,496, 86,745,933, 96,384,370
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 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1238the total stopping time
Highest value reached69,475,1567× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,638,437 → 28,915,312 → 14,457,656 → 7,228,828 → 3,614,414 → 1,807,207 → 5,421,622 → 2,710,811 → 8,132,434 → 4,066,217 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage963,843,700%
9,638,437% as a decimal96,384.37
9,638,437% of 1009,638,437
9,638,437% of 1,00096,384,370
As a fraction of 1009,638,437/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,638,437
Nerdulate something else
Nothing in mind? Surprise me · today’s page