Recognised as Number
9,613,837
- Positive
- Odd
- Prime
- 7 digits
9,613,837 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,613,837
Digit count7
Digit sum37
Digit product27,216
Multiplicative persistence5times 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,613,837
Distinct prime factors19,613,837
Number of divisors2
Sum of divisors σ(n)9,613,838
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,613,836integers below n that share no factor with it
Carmichael function λ(n)9,613,836the 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,613,8372 in total
Arithmetic
Previous number9,613,836
Next number9,613,838
Double19,227,674
Half4,806,918.5
Square92,425,861,862,569
Cube888,567,170,531,254,767,253
Square root3,100.618809206≈irrational, shown to 9 decimal places
Cube root212.633775973≈
Negation-9,613,837
Reciprocal1.04016742 × 10^-7≈
Representations
Decimal9,613,837
Binary10010010101100100000110124 bits
Octal44531015
Hexadecimal92B20D
Base 365Q231
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, six hundred and thirteen thousand, eight hundred and thirty-seven
Ordinalnine million, six hundred and thirteen thousand, eight hundred and thirty-seventh
Scientific notation9.613837 × 10^6
Engineering notation9.613837 × 10^6
In other bases
Ternary200002102201001base 3; the most digit-efficient integer base after e: 15 digits
Quinary4430120322base 5; one hand: 10 digits
Septenary144500452base 7: 9 digits
Nonary20072631base 9; each digit is two ternary digits: 8 digits
Duodecimal3277691base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal301ebhbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal44:30:30:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0001T110T01001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100101111111011000011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100100101011001000001101
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
Bytes392 b2 0d
Gray code110110111110101100001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100100101011001000001101
64-bit0000000000000000000000000000000000000000100100101011001000001101
One's complement11111111011011010100110111110010at 32 bits, every bit flipped
Bits reversed10110000010011010100100100000000at 32 bits
Rotated left by 100000001001001010110010000011010at 32 bits, wrapping
Shifted left by 11001001010110010000011010= 19,227,674, no wrap
Shifted right by 110010010101100100000110= 4,806,918, discarding the low bit
These bits as a double4.74986659 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,613,837 to the power 292,425,861,862,569
9,613,837 to the power 3888,567,170,531,254,767,253
9,613,837 to the power 48,542,539,941,038,686,737,843,279,761
9,613,837 to the power 582,126,586,559,135,544,991,687,023,167,652,957
First ten multiples9,613,837, 19,227,674, 28,841,511, 38,455,348, 48,069,185, 57,683,022, 67,296,859, 76,910,696, 86,524,533, 96,138,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 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1194the total stopping time
Highest value reached28,841,5123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,613,837 → 28,841,512 → 14,420,756 → 7,210,378 → 3,605,189 → 10,815,568 → 5,407,784 → 2,703,892 → 1,351,946 → 675,973 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage961,383,700%
9,613,837% as a decimal96,138.37
9,613,837% of 1009,613,837
9,613,837% of 1,00096,138,370
As a fraction of 1009,613,837/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,613,837
Nerdulate something else
Nothing in mind? Surprise me · today’s page