Recognised as Number

9,459,864

Positive
Even
Composite
7 digits

9,459,864 is an even 7-digit integer and a composite number. It has 96 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value9,459,864

Digit count7

Digit sum45

Digit product311,040

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 3^2 × 37 × 53 × 67

Distinct prime factors52, 3, 37, 53, 67

Number of divisors96

Sum of divisors σ(n)27,209,520

Aliquot sum17,749,656sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)2,965,248integers below n that share no factor with it

Carmichael function λ(n)5,148the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,965,248

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 37, 53, 67, 72, 74, 106, 111, 134, 148, 159, 201, 212, 222, 268, 296, 318, 333, 402, 424, 444, 477, 536, 603, 636, 666, 804, 888, 954, 1,206, 1,272, 1,332, 1,608, 1,908, 1,961, 2,412, 2,479, 2,664, 3,551, 3,816, 3,922, 4,824, 4,958, 5,883, 7,102, 7,437, 7,844, 9,916, 10,653, 11,766, 14,204, 14,874, 15,688, 17,649, 19,832, 21,306, 22,311, 23,532, 28,408, 29,748, 31,959, 35,298, 42,612, 44,622, 47,064, 59,496, 63,918, 70,596, 85,224, 89,244, 127,836, 131,387, 141,192, 178,488, 255,672, 262,774, 394,161, 525,548, 788,322, 1,051,096, 1,182,483, 1,576,644, 2,364,966, 3,153,288, 4,729,932, 9,459,86496 in total

Arithmetic

Previous number9,459,863

Next number9,459,865

Double18,919,728

Half4,729,932

Square89,489,026,898,496

Cube846,554,023,952,113,964,544

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

Cube root211.492496758≈

Negation-9,459,864

Reciprocal1.05709765 × 10^-7≈

Representations

Decimal9,459,864

Binary10010000010110001001100024 bits

Octal44054230

Hexadecimal905898

Base 365MRA0

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

In wordsnine million, four hundred and fifty-nine thousand, eight hundred and sixty-four

Ordinalnine million, four hundred and fifty-nine thousand, eight hundred and sixty-fourth

Scientific notation9.459864 × 10^6

Engineering notation9.459864 × 10^6

In other bases

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

Quinary4410203424base 5; one hand: 10 digits

Septenary143256531base 7: 9 digits

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

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

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

Sexagesimal43:47:44:24base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000100100000101100010011000

Bit length24 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits16within that length

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

Highest set bitbit 23worth 8,388,608

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes390 58 98

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

At each machine width

32-bit00000000100100000101100010011000

64-bit0000000000000000000000000000000000000000100100000101100010011000

One's complement11111111011011111010011101100111at 32 bits, every bit flipped

Bits reversed00011001000110100000100100000000at 32 bits

Rotated left by 100000001001000001011000100110000at 32 bits, wrapping

Shifted left by 11001000001011000100110000= 18,919,728, no wrap

Shifted right by 110010000010110001001100= 4,729,932, discarding the low bit

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

Nearest landmarks

Next prime9,459,869+5

Previous prime9,459,839−25

Distance to nearest prime5

Nearest square below9,455,625

Nearest square above9,461,776

Powers & multiples

9,459,864 to the power 289,489,026,898,496

9,459,864 to the power 3846,554,023,952,113,964,544

9,459,864 to the power 48,008,285,935,239,740,617,087,062,016

9,459,864 to the power 575,757,295,820,480,753,632,919,682,830,925,824

First ten multiples9,459,864, 18,919,728, 28,379,592, 37,839,456, 47,299,320, 56,759,184, 66,219,048, 75,678,912, 85,138,776, 94,598,640

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6Yes

Divisible by 7No, remainder 1

Divisible by 8Yes

Divisible by 9Yes

Divisible by 10No, remainder 4

Divisible by 11No, remainder 7

Divisible by 12Yes

Divisible by 100No, remainder 64

Collatz (3n + 1) trajectory

Steps to reach 1238the total stopping time

Highest value reached9,459,864

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

First steps9,459,864 → 4,729,932 → 2,364,966 → 1,182,483 → 3,547,450 → 1,773,725 → 5,321,176 → 2,660,588 → 1,330,294 → 665,147 → …

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

As a percentage & fraction

As a percentage945,986,400%

9,459,864% as a decimal94,598.64

9,459,864% of 1009,459,864

9,459,864% of 1,00094,598,640

As a fraction of 1009,459,864/100

Read another way

As seconds109 days, 11 hours and 44 minutes

As bytes9.022 MiB

As a 24-bit colour#905898

Keep nerding

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