Recognised as Number
8,023,601
- Positive
- Odd
- Prime
- 7 digits
8,023,601 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value8,023,601
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation8,023,601
Distinct prime factors18,023,601
Number of divisors2
Sum of divisors σ(n)8,023,602
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,023,600integers below n that share no factor with it
Carmichael function λ(n)8,023,600the 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,023,6012 in total
Arithmetic
Previous number8,023,600
Next number8,023,602
Double16,047,202
Half4,011,800.5
Square64,378,173,007,201
Cube516,544,773,318,750,950,801
Square root2,832.596159003≈irrational, shown to 9 decimal places
Cube root200.196481911≈
Negation-8,023,601
Reciprocal1.24632319 × 10^-7≈
Representations
Decimal8,023,601
Binary1111010011011100011000123 bits
Octal36467061
Hexadecimal7A6E31
Base 364RZ1T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, twenty-three thousand, six hundred and one
Ordinaleight million, twenty-three thousand, six hundred and first
Scientific notation8.023601 × 10^6
Engineering notation8.023601 × 10^6
In other bases
Ternary120002122022102base 3; the most digit-efficient integer base after e: 15 digits
Quinary4023223401base 5; one hand: 10 digits
Septenary125125265base 7: 9 digits
Nonary16078272base 9; each digit is two ternary digits: 8 digits
Duodecimal282b355base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2a2j01base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal37:8:46:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT0010T0T10T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100011111011001001110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011110100110111000110001
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 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
Bytes37a 6e 31
Gray code10001110101100100101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011110100110111000110001
64-bit0000000000000000000000000000000000000000011110100110111000110001
One's complement11111111100001011001000111001110at 32 bits, every bit flipped
Bits reversed10001100011101100101111000000000at 32 bits
Rotated left by 100000000111101001101110001100010at 32 bits, wrapping
Shifted left by 1111101001101110001100010= 16,047,202, no wrap
Shifted right by 11111010011011100011000= 4,011,800, discarding the low bit
These bits as a double3.96418561 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,023,601 to the power 264,378,173,007,201
8,023,601 to the power 3516,544,773,318,750,950,801
8,023,601 to the power 44,144,549,159,745,103,447,597,854,401
8,023,601 to the power 533,254,208,782,679,971,767,249,592,169,718,001
First ten multiples8,023,601, 16,047,202, 24,070,803, 32,094,404, 40,118,005, 48,141,606, 56,165,207, 64,188,808, 72,212,409, 80,236,010
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1168the total stopping time
Highest value reached38,556,8084× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,023,601 → 24,070,804 → 12,035,402 → 6,017,701 → 18,053,104 → 9,026,552 → 4,513,276 → 2,256,638 → 1,128,319 → 3,384,958 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage802,360,100%
8,023,601% as a decimal80,236.01
8,023,601% of 1008,023,601
8,023,601% of 1,00080,236,010
As a fraction of 1008,023,601/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,023,601
Nerdulate something else
Nothing in mind? Surprise me · today’s page