Recognised as Number

9,280,672

Positive
Even
Composite
7 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value9,280,672

Digit count7

Digit sum34

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^5 × 290,021

Distinct prime factors22, 290,021

Number of divisors12

Sum of divisors σ(n)18,271,386

Aliquot sum8,990,714sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)580,040the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,640,320

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 32, 290,021, 580,042, 1,160,084, 2,320,168, 4,640,336, 9,280,67212 in total

Arithmetic

Previous number9,280,671

Next number9,280,673

Double18,561,344

Half4,640,336

Square86,130,872,771,584

Cube799,352,379,266,802,024,448

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

Cube root210.148587207≈

Negation-9,280,672

Reciprocal1.07750818 × 10^-7≈

Representations

Decimal9,280,672

Binary10001101100111001010000024 bits

Octal43316240

Hexadecimal8D9CA0

Base 365IX0G

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

In wordsnine million, two hundred and eighty thousand, six hundred and seventy-two

Ordinalnine million, two hundred and eighty thousand, six hundred and seventy-second

Scientific notation9.280672 × 10^6

Engineering notation9.280672 × 10^6

In other bases

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

Quinary4333440142base 5; one hand: 10 digits

Septenary141612232base 7: 9 digits

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

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

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

Sexagesimal42:57:57:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000100011011001110010100000

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 even

Highest set bitbit 23worth 8,388,608

Lowest set bitbit 55 trailing zeros

Power of twoNo

Bytes38d 9c a0

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

At each machine width

32-bit00000000100011011001110010100000

64-bit0000000000000000000000000000000000000000100011011001110010100000

One's complement11111111011100100110001101011111at 32 bits, every bit flipped

Bits reversed00000101001110011011000100000000at 32 bits

Rotated left by 100000001000110110011100101000000at 32 bits, wrapping

Shifted left by 11000110110011100101000000= 18,561,344, no wrap

Shifted right by 110001101100111001010000= 4,640,336, discarding the low bit

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

Nearest landmarks

Next prime9,280,679+7

Previous prime9,280,651−21

Distance to nearest prime7

Nearest square below9,278,116

Nearest square above9,284,209

Powers & multiples

9,280,672 to the power 286,130,872,771,584

9,280,672 to the power 3799,352,379,266,802,024,448

9,280,672 to the power 47,418,527,244,394,790,077,837,869,056

9,280,672 to the power 568,848,918,078,291,885,221,267,731,887,685,632

First ten multiples9,280,672, 18,561,344, 27,842,016, 37,122,688, 46,403,360, 55,684,032, 64,964,704, 74,245,376, 83,526,048, 92,806,720

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 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 2

Divisible by 8Yes

Divisible by 9No, remainder 7

Divisible by 10No, remainder 2

Divisible by 11No, remainder 5

Divisible by 12No, remainder 4

Divisible by 100No, remainder 72

Collatz (3n + 1) trajectory

Steps to reach 1194the total stopping time

Highest value reached9,280,672

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

First steps9,280,672 → 4,640,336 → 2,320,168 → 1,160,084 → 580,042 → 290,021 → 870,064 → 435,032 → 217,516 → 108,758 → …

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

As a percentage & fraction

As a percentage928,067,200%

9,280,672% as a decimal92,806.72

9,280,672% of 1009,280,672

9,280,672% of 1,00092,806,720

As a fraction of 1009,280,672/100

Read another way

As seconds107 days, 9 hours and 57 minutes

As bytes8.851 MiB

As a 24-bit colour#8D9CA0

Keep nerding

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