Recognised as Number

9,960,561

Positive
Odd
Composite
7 digits

9,960,561 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value9,960,561

Digit count7

Digit sum36

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 13 × 85,133

Distinct prime factors33, 13, 85,133

Number of divisors12

Sum of divisors σ(n)15,494,388

Aliquot sum5,533,827sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)6,129,504integers below n that share no factor with it

Carmichael function λ(n)255,396the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,129,504

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 13, 39, 117, 85,133, 255,399, 766,197, 1,106,729, 3,320,187, 9,960,56112 in total

Arithmetic

Previous number9,960,560

Next number9,960,562

Double19,921,122

Half4,980,280.5

Square99,212,775,434,721

Cube988,214,901,696,840,038,481

Square root3,156.035646187≈irrational, shown to 9 decimal places

Cube root215.159866677≈

Negation-9,960,561

Reciprocal1.00395952 × 10^-7≈

Representations

Decimal9,960,561

Binary10010111111111000111000124 bits

Octal45776161

Hexadecimal97FC71

Base 365XHM9

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsnine million, nine hundred and sixty thousand, five hundred and sixty-one

Ordinalnine million, nine hundred and sixty thousand, five hundred and sixty-first

Scientific notation9.960561 × 10^6

Engineering notation9.960561 × 10^6

In other bases

Ternary200202001022200base 3; the most digit-efficient integer base after e: 15 digits

Quinary10022214221base 5; one hand: 11 digits

Septenary150443352base 7: 9 digits

Nonary20661280base 9; each digit is two ternary digits: 8 digits

Duodecimal3404269base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal325181base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal46:6:49:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T01T1T001100T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1111010000000110110110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100101111111110001110001

Bit length24 bitsto write the magnitude

Set bits15the population count, or Hamming weight

Zero bits9within that length

Bit parityodd15 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

Bytes397 fc 71

Gray code110111000000001001001001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100101111111110001110001

64-bit0000000000000000000000000000000000000000100101111111110001110001

One's complement11111111011010000000001110001110at 32 bits, every bit flipped

Bits reversed10001110001111111110100100000000at 32 bits

Rotated left by 100000001001011111111100011100010at 32 bits, wrapping

Shifted left by 11001011111111100011100010= 19,921,122, no wrap

Shifted right by 110010111111111000111000= 4,980,280, discarding the low bit

These bits as a double4.921171 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,960,583+22

Previous prime9,960,553−8

Distance to nearest prime8

Nearest square below9,960,336

Nearest square above9,966,649

Powers & multiples

9,960,561 to the power 299,212,775,434,721

9,960,561 to the power 3988,214,901,696,840,038,481

9,960,561 to the power 49,843,174,809,460,378,710,532,347,841

9,960,561 to the power 598,043,543,123,293,479,229,358,793,143,498,801

First ten multiples9,960,561, 19,921,122, 29,881,683, 39,842,244, 49,802,805, 59,763,366, 69,723,927, 79,684,488, 89,645,049, 99,605,610

Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 6

Divisible by 12No, remainder 9

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1101the total stopping time

Highest value reached29,881,6843× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps9,960,561 → 29,881,684 → 14,940,842 → 7,470,421 → 22,411,264 → 11,205,632 → 5,602,816 → 2,801,408 → 1,400,704 → 700,352 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage996,056,100%

9,960,561% as a decimal99,605.61

9,960,561% of 1009,960,561

9,960,561% of 1,00099,605,610

As a fraction of 1009,960,561/100

Read another way

As seconds115 days, 6 hours and 49 minutes

As bytes9.499 MiB

As a 24-bit colour#97FC71

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.