Recognised as Number
8,722,701
- Positive
- Odd
- Composite
- 7 digits
8,722,701 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value8,722,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 numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3^3 × 13 × 24,851
Distinct prime factors33, 13, 24,851
Number of divisors16
Sum of divisors σ(n)13,917,120
Aliquot sum5,194,419sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,367,600integers below n that share no factor with it
Carmichael function λ(n)447,300the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,367,600
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 13, 27, 39, 117, 351, 24,851, 74,553, 223,659, 323,063, 670,977, 969,189, 2,907,567, 8,722,70116 in total
Arithmetic
Previous number8,722,700
Next number8,722,702
Double17,445,402
Half4,361,350.5
Square76,085,512,735,401
Cube663,671,178,022,595,038,101
Square root2,953.421913645≈irrational, shown to 9 decimal places
Cube root205.849742755≈
Negation-8,722,701
Reciprocal1.14643389 × 10^-7≈
Representations
Decimal8,722,701
Binary10000101000110010000110124 bits
Octal41214415
Hexadecimal85190D
Base 3656YH9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, seven hundred and twenty-two thousand, seven hundred and one
Ordinaleight million, seven hundred and twenty-two thousand, seven hundred and first
Scientific notation8.722701 × 10^6
Engineering notation8.722701 × 10^6
In other bases
Ternary121102011022000base 3; the most digit-efficient integer base after e: 15 digits
Quinary4213111301base 5; one hand: 10 digits
Septenary134066421base 7: 9 digits
Nonary17364260base 9; each digit is two ternary digits: 8 digits
Duodecimal2b07a39base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2ea6f1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal40:22:58:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT111T01110T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100001010110100100011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100001010001100100001101
Bit length24 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits15within that length
Bit parityodd9 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 19 0d
Gray code110001111001010110001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100001010001100100001101
64-bit0000000000000000000000000000000000000000100001010001100100001101
One's complement11111111011110101110011011110010at 32 bits, every bit flipped
Bits reversed10110000100110001010000100000000at 32 bits
Rotated left by 100000001000010100011001000011010at 32 bits, wrapping
Shifted left by 11000010100011001000011010= 17,445,402, no wrap
Shifted right by 110000101000110010000110= 4,361,350, discarding the low bit
These bits as a double4.3095869 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,722,701 to the power 276,085,512,735,401
8,722,701 to the power 3663,671,178,022,595,038,101
8,722,701 to the power 45,789,005,248,208,867,761,438,630,801
8,722,701 to the power 550,495,761,867,556,739,031,568,506,326,513,501
First ten multiples8,722,701, 17,445,402, 26,168,103, 34,890,804, 43,613,505, 52,336,206, 61,058,907, 69,781,608, 78,504,309, 87,227,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 5
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 193the total stopping time
Highest value reached26,168,1043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,722,701 → 26,168,104 → 13,084,052 → 6,542,026 → 3,271,013 → 9,813,040 → 4,906,520 → 2,453,260 → 1,226,630 → 613,315 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage872,270,100%
8,722,701% as a decimal87,227.01
8,722,701% of 1008,722,701
8,722,701% of 1,00087,227,010
As a fraction of 1008,722,701/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,722,701
Nerdulate something else
Nothing in mind? Surprise me · today’s page