Recognised as Number

9,369,331

Positive
Odd
Composite
7 digits

9,369,331 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value9,369,331

Digit count7

Digit sum34

Digit product13,122

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation73 × 128,347

Distinct prime factors273, 128,347

Number of divisors4

Sum of divisors σ(n)9,497,752

Aliquot sum128,421sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)9,240,912integers below n that share no factor with it

Carmichael function λ(n)1,540,152the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 9,240,912

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 73, 128,347, 9,369,3314 in total

Arithmetic

Previous number9,369,330

Next number9,369,332

Double18,738,662

Half4,684,665.5

Square87,784,363,387,561

Cube822,480,757,202,340,291,691

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

Cube root210.815656247≈

Negation-9,369,331

Reciprocal1.06731206 × 10^-7≈

Representations

Decimal9,369,331

Binary10001110111101101111001124 bits

Octal43573363

Hexadecimal8EF6F3

Base 365KTF7

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

In wordsnine million, three hundred and sixty-nine thousand, three hundred and thirty-one

Ordinalnine million, three hundred and sixty-nine thousand, three hundred and thirty-first

Scientific notation9.369331 × 10^6

Engineering notation9.369331 × 10^6

In other bases

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

Quinary4344304311base 5; one hand: 10 digits

Septenary142431556base 7: 9 digits

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

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

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

Sexagesimal43:22:35:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000100011101111011011110011

Bit length24 bitsto write the magnitude

Set bits16the population count, or Hamming weight

Zero bits8within that length

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

Bytes38e f6 f3

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

At each machine width

32-bit00000000100011101111011011110011

64-bit0000000000000000000000000000000000000000100011101111011011110011

One's complement11111111011100010000100100001100at 32 bits, every bit flipped

Bits reversed11001111011011110111000100000000at 32 bits

Rotated left by 100000001000111011110110111100110at 32 bits, wrapping

Shifted left by 11000111011110110111100110= 18,738,662, no wrap

Shifted right by 110001110111101101111001= 4,684,665, discarding the low bit

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

Nearest landmarks

Next prime9,369,341+10

Previous prime9,369,323−8

Distance to nearest prime8

Nearest square below9,363,600

Nearest square above9,369,721

Powers & multiples

9,369,331 to the power 287,784,363,387,561

9,369,331 to the power 3822,480,757,202,340,291,691

9,369,331 to the power 47,706,094,455,359,360,167,489,528,721

9,369,331 to the power 572,200,949,669,526,569,357,424,833,621,055,651

First ten multiples9,369,331, 18,738,662, 28,107,993, 37,477,324, 46,846,655, 56,215,986, 65,585,317, 74,954,648, 84,323,979, 93,693,310

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 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 3

Divisible by 9No, remainder 7

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 7

Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 1155the total stopping time

Highest value reached42,161,9924× the starting value

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

First steps9,369,331 → 28,107,994 → 14,053,997 → 42,161,992 → 21,080,996 → 10,540,498 → 5,270,249 → 15,810,748 → 7,905,374 → 3,952,687 → …

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

As a percentage & fraction

As a percentage936,933,100%

9,369,331% as a decimal93,693.31

9,369,331% of 1009,369,331

9,369,331% of 1,00093,693,310

As a fraction of 1009,369,331/100

Read another way

As seconds108 days, 10 hours and 35 minutes

As bytes8.935 MiB

As a 24-bit colour#8EF6F3

Keep nerding

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