Recognised as Number

9,760,204

Positive
Even
Composite
7 digits

9,760,204 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value9,760,204

Digit count7

Digit sum28

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation2^2 × 127 × 19,213

Distinct prime factors32, 127, 19,213

Number of divisors12

Sum of divisors σ(n)17,215,744

Aliquot sum7,455,540sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)4,841,424integers below n that share no factor with it

Carmichael function λ(n)403,452the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,841,424

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 127, 254, 508, 19,213, 38,426, 76,852, 2,440,051, 4,880,102, 9,760,20412 in total

Arithmetic

Previous number9,760,203

Next number9,760,205

Double19,520,408

Half4,880,102

Square95,261,582,121,616

Cube929,772,474,869,724,969,664

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

Cube root213.707434954≈

Negation-9,760,204

Reciprocal1.02456875 × 10^-7≈

Representations

Decimal9,760,204

Binary10010100111011011100110024 bits

Octal45166714

Hexadecimal94EDCC

Base 365T70S

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

In wordsnine million, seven hundred and sixty thousand, two hundred and four

Ordinalnine million, seven hundred and sixty thousand, two hundred and fourth

Scientific notation9.760204 × 10^6

Engineering notation9.760204 × 10^6

In other bases

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

Quinary4444311304base 5; one hand: 10 digits

Septenary145650256base 7: 9 digits

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

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

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

Sexagesimal45:11:10:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000100101001110110111001100

Bit length24 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits11within that length

Bit parityodd13 set bits, so odd; not the same as the number itself being even

Highest set bitbit 23worth 8,388,608

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes394 ed cc

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

At each machine width

32-bit00000000100101001110110111001100

64-bit0000000000000000000000000000000000000000100101001110110111001100

One's complement11111111011010110001001000110011at 32 bits, every bit flipped

Bits reversed00110011101101110010100100000000at 32 bits

Rotated left by 100000001001010011101101110011000at 32 bits, wrapping

Shifted left by 11001010011101101110011000= 19,520,408, no wrap

Shifted right by 110010100111011011100110= 4,880,102, discarding the low bit

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

Nearest landmarks

Next prime9,760,217+13

Previous prime9,760,199−5

Distance to nearest prime5

Nearest square below9,759,376

Nearest square above9,765,625

Powers & multiples

9,760,204 to the power 295,261,582,121,616

9,760,204 to the power 3929,772,474,869,724,969,664

9,760,204 to the power 49,074,769,028,313,389,127,814,451,456

9,760,204 to the power 588,571,596,969,220,453,818,851,120,358,657,024

First ten multiples9,760,204, 19,520,408, 29,280,612, 39,040,816, 48,801,020, 58,561,224, 68,321,428, 78,081,632, 87,841,836, 97,602,040

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6No, remainder 4

Divisible by 7No, remainder 6

Divisible by 8No, remainder 4

Divisible by 9No, remainder 1

Divisible by 10No, remainder 4

Divisible by 11No, remainder 3

Divisible by 12No, remainder 4

Divisible by 100No, remainder 4

Collatz (3n + 1) trajectory

Steps to reach 1163the total stopping time

Highest value reached10,980,2321× the starting value

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

First steps9,760,204 → 4,880,102 → 2,440,051 → 7,320,154 → 3,660,077 → 10,980,232 → 5,490,116 → 2,745,058 → 1,372,529 → 4,117,588 → …

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

As a percentage & fraction

As a percentage976,020,400%

9,760,204% as a decimal97,602.04

9,760,204% of 1009,760,204

9,760,204% of 1,00097,602,040

As a fraction of 1009,760,204/100

Read another way

As seconds112 days, 23 hours and 10 minutes

As bytes9.308 MiB

As a 24-bit colour#94EDCC

Keep nerding

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