Recognised as Number

8,308,701

Positive
Odd
Composite
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value8,308,701

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

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 103 × 8,963

Distinct prime factors33, 103, 8,963

Number of divisors12

Sum of divisors σ(n)12,119,328

Aliquot sum3,810,627sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)5,484,744integers below n that share no factor with it

Carmichael function λ(n)457,062the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,484,744

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 103, 309, 927, 8,963, 26,889, 80,667, 923,189, 2,769,567, 8,308,70112 in total

Arithmetic

Previous number8,308,700

Next number8,308,702

Double16,617,402

Half4,154,350.5

Square69,034,512,307,401

Cube573,587,121,443,014,996,101

Square root2,882.481743221≈irrational, shown to 9 decimal places

Cube root202.540110939≈

Negation-8,308,701

Reciprocal1.20355757 × 10^-7≈

Representations

Decimal8,308,701

Binary1111110110001111101110123 bits

Octal37543735

Hexadecimal7EC7DD

Base 364Y319

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

In wordseight million, three hundred and eight thousand, seven hundred and one

Ordinaleight million, three hundred and eight thousand, seven hundred and first

Scientific notation8.308701 × 10^6

Engineering notation8.308701 × 10^6

In other bases

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

Quinary4111334301base 5; one hand: 10 digits

Septenary130423422base 7: 9 digits

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

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

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

Sexagesimal38:27:58:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000011111101100011111011101

Bit length23 bitsto write the magnitude

Set bits17the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 22worth 4,194,304

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes37e c7 dd

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

At each machine width

32-bit00000000011111101100011111011101

64-bit0000000000000000000000000000000000000000011111101100011111011101

One's complement11111111100000010011100000100010at 32 bits, every bit flipped

Bits reversed10111011111000110111111000000000at 32 bits

Rotated left by 100000000111111011000111110111010at 32 bits, wrapping

Shifted left by 1111111011000111110111010= 16,617,402, no wrap

Shifted right by 11111110110001111101110= 4,154,350, discarding the low bit

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

Nearest landmarks

Next prime8,308,709+8

Previous prime8,308,697−4

Distance to nearest prime4

Nearest square below8,305,924

Nearest square above8,311,689

Powers & multiples

8,308,701 to the power 269,034,512,307,401

8,308,701 to the power 3573,587,121,443,014,996,101

8,308,701 to the power 44,765,763,889,520,700,141,119,374,801

8,308,701 to the power 539,597,307,194,624,530,783,218,690,528,443,501

First ten multiples8,308,701, 16,617,402, 24,926,103, 33,234,804, 41,543,505, 49,852,206, 58,160,907, 66,469,608, 74,778,309, 83,087,010

Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

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 2

Divisible by 8No, remainder 5

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 1230the total stopping time

Highest value reached33,688,2764× the starting value

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

First steps8,308,701 → 24,926,104 → 12,463,052 → 6,231,526 → 3,115,763 → 9,347,290 → 4,673,645 → 14,020,936 → 7,010,468 → 3,505,234 → …

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

As a percentage & fraction

As a percentage830,870,100%

8,308,701% as a decimal83,087.01

8,308,701% of 1008,308,701

8,308,701% of 1,00083,087,010

As a fraction of 1008,308,701/100

Read another way

As seconds96 days, 3 hours and 58 minutes

As bytes7.924 MiB

As a 24-bit colour#7EC7DD

Keep nerding

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