Recognised as Number
8,716,613
- Positive
- Odd
- Prime
- 7 digits
8,716,613 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value8,716,613
Digit count7
Digit sum32
Digit product6,048
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation8,716,613
Distinct prime factors18,716,613
Number of divisors2
Sum of divisors σ(n)8,716,614
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,716,612integers below n that share no factor with it
Carmichael function λ(n)8,716,612the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 8,716,6132 in total
Arithmetic
Previous number8,716,612
Next number8,716,614
Double17,433,226
Half4,358,306.5
Square75,979,342,191,769
Cube662,282,521,880,222,158,397
Square root2,952.391064883≈irrational, shown to 9 decimal places
Cube root205.801840738≈
Negation-8,716,613
Reciprocal1.1472346 × 10^-7≈
Representations
Decimal8,716,613
Binary10000101000000010100010124 bits
Octal41200505
Hexadecimal850145
Base 3656TS5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, seven hundred and sixteen thousand, six hundred and thirteen
Ordinaleight million, seven hundred and sixteen thousand, six hundred and thirteenth
Scientific notation8.716613 × 10^6
Engineering notation8.716613 × 10^6
In other bases
Ternary121101211221112base 3; the most digit-efficient integer base after e: 15 digits
Quinary4212412423base 5; one hand: 10 digits
Septenary134042603base 7: 9 digits
Nonary17354845base 9; each digit is two ternary digits: 8 digits
Duodecimal2b04405base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2e9badbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal40:21:16:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT111T0TT00TTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100001010000000101000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100001010000000101000101
Bit length24 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits17within that length
Bit parityodd7 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
Bytes385 01 45
Gray code110001111000000111100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100001010000000101000101
64-bit0000000000000000000000000000000000000000100001010000000101000101
One's complement11111111011110101111111010111010at 32 bits, every bit flipped
Bits reversed10100010100000001010000100000000at 32 bits
Rotated left by 100000001000010100000001010001010at 32 bits, wrapping
Shifted left by 11000010100000001010001010= 17,433,226, no wrap
Shifted right by 110000101000000010100010= 4,358,306, discarding the low bit
These bits as a double4.30657903 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,716,613 to the power 275,979,342,191,769
8,716,613 to the power 3662,282,521,880,222,158,397
8,716,613 to the power 45,772,860,439,893,928,908,771,349,361
8,716,613 to the power 550,319,790,357,565,139,347,272,157,867,634,293
First ten multiples8,716,613, 17,433,226, 26,149,839, 34,866,452, 43,583,065, 52,299,678, 61,016,291, 69,732,904, 78,449,517, 87,166,130
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1168the total stopping time
Highest value reached26,149,8403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,716,613 → 26,149,840 → 13,074,920 → 6,537,460 → 3,268,730 → 1,634,365 → 4,903,096 → 2,451,548 → 1,225,774 → 612,887 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage871,661,300%
8,716,613% as a decimal87,166.13
8,716,613% of 1008,716,613
8,716,613% of 1,00087,166,130
As a fraction of 1008,716,613/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 8,716,613
Nerdulate something else
Nothing in mind? Surprise me · today’s page