Recognised as Number

9,308,601

Positive
Odd
Composite
Perfect square
7 digits

9,308,601 is an odd 7-digit integer and a composite number. It has 21 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value9,308,601

Digit count7

Digit sum27

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

Perfect squareYes, 3,051²

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^6 × 113^2

Distinct prime factors23, 113

Number of divisors21

Sum of divisors σ(n)14,081,119

Aliquot sum4,772,518sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)3,075,408the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,150,816

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 27, 81, 113, 243, 339, 729, 1,017, 3,051, 9,153, 12,769, 27,459, 38,307, 82,377, 114,921, 344,763, 1,034,289, 3,102,867, 9,308,60121 in total

Arithmetic

Previous number9,308,600

Next number9,308,602

Double18,617,202

Half4,654,300.5

Square86,650,052,577,201

Cube806,590,766,070,185,805,801

Square root3,051exact

Cube root210.359181229≈

Negation-9,308,601

Reciprocal1.07427529 × 10^-7≈

Representations

Decimal9,308,601

Binary10001110000010011011100124 bits

Octal43404671

Hexadecimal8E09B9

Base 365JIK9

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

In wordsnine million, three hundred and eight thousand, six hundred and one

Ordinalnine million, three hundred and eight thousand, six hundred and first

Scientific notation9.308601 × 10^6

Engineering notation9.308601 × 10^6

In other bases

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

Quinary4340333401base 5; one hand: 10 digits

Septenary142056531base 7: 9 digits

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

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

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

Sexagesimal43:5:43:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000100011100000100110111001

Bit length24 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits13within that length

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

Bytes38e 09 b9

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

At each machine width

32-bit00000000100011100000100110111001

64-bit0000000000000000000000000000000000000000100011100000100110111001

One's complement11111111011100011111011001000110at 32 bits, every bit flipped

Bits reversed10011101100100000111000100000000at 32 bits

Rotated left by 100000001000111000001001101110010at 32 bits, wrapping

Shifted left by 11000111000001001101110010= 18,617,202, no wrap

Shifted right by 110001110000010011011100= 4,654,300, discarding the low bit

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

Nearest landmarks

Next prime9,308,603+2

Previous prime9,308,591−10

Distance to nearest prime2

Nearest square below9,308,601

Nearest square above9,314,704

Powers & multiples

9,308,601 to the power 286,650,052,577,201

9,308,601 to the power 3806,590,766,070,185,805,801

9,308,601 to the power 47,508,231,611,631,697,662,064,994,401

9,308,601 to the power 569,891,132,288,266,432,488,795,868,946,143,001

First ten multiples9,308,601, 18,617,202, 27,925,803, 37,234,404, 46,543,005, 55,851,606, 65,160,207, 74,468,808, 83,777,409, 93,086,010

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 1

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 5

Divisible by 12No, remainder 9

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1194the total stopping time

Highest value reached31,416,5323× the starting value

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

First steps9,308,601 → 27,925,804 → 13,962,902 → 6,981,451 → 20,944,354 → 10,472,177 → 31,416,532 → 15,708,266 → 7,854,133 → 23,562,400 → …

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

As a percentage & fraction

As a percentage930,860,100%

9,308,601% as a decimal93,086.01

9,308,601% of 1009,308,601

9,308,601% of 1,00093,086,010

As a fraction of 1009,308,601/100

Read another way

As seconds107 days, 17 hours and 43 minutes

As bytes8.877 MiB

As a 24-bit colour#8E09B9

Keep nerding

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