Recognised as Number
8,227,466
- Positive
- Even
- Composite
- 7 digits
8,227,466 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value8,227,466
Digit count7
Digit sum35
Digit product32,256
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 13 × 67 × 4,723
Distinct prime factors42, 13, 67, 4,723
Number of divisors16
Sum of divisors σ(n)13,491,744
Aliquot sum5,264,278sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,739,824integers below n that share no factor with it
Carmichael function λ(n)103,884the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,739,824
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 13, 26, 67, 134, 871, 1,742, 4,723, 9,446, 61,399, 122,798, 316,441, 632,882, 4,113,733, 8,227,46616 in total
Arithmetic
Previous number8,227,465
Next number8,227,467
Double16,454,932
Half4,113,733
Square67,691,196,781,156
Cube556,927,020,016,270,430,696
Square root2,868.355975119≈irrational, shown to 9 decimal places
Cube root201.87786297≈
Negation-8,227,466
Reciprocal1.21544106 × 10^-7≈
Representations
Decimal8,227,466
Binary1111101100010101000101023 bits
Octal37305212
Hexadecimal7D8A8A
Base 364WCCQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, two hundred and twenty-seven thousand, four hundred and sixty-six
Ordinaleight million, two hundred and twenty-seven thousand, four hundred and sixty-sixth
Scientific notation8.227466 × 10^6
Engineering notation8.227466 × 10^6
In other bases
Ternary120110222221222base 3; the most digit-efficient integer base after e: 15 digits
Quinary4101234331base 5; one hand: 10 digits
Septenary126634532base 7: 9 digits
Nonary16428858base 9; each digit is two ternary digits: 8 digits
Duodecimal2909322base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2b88d6base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal38:5:24:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT011100000T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000101001111110011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011111011000101010001010
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 set bits, so even; not the same as the number itself being even
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes37d 8a 8a
Gray code10000110100111111001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011111011000101010001010
64-bit0000000000000000000000000000000000000000011111011000101010001010
One's complement11111111100000100111010101110101at 32 bits, every bit flipped
Bits reversed01010001010100011011111000000000at 32 bits
Rotated left by 100000000111110110001010100010100at 32 bits, wrapping
Shifted left by 1111110110001010100010100= 16,454,932, no wrap
Shifted right by 11111101100010101000101= 4,113,733, discarding the low bit
These bits as a double4.0649083 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,227,466 to the power 267,691,196,781,156
8,227,466 to the power 3556,927,020,016,270,430,696
8,227,466 to the power 44,582,098,121,665,184,415,356,696,336
8,227,466 to the power 537,699,056,504,664,168,161,077,096,976,764,576
First ten multiples8,227,466, 16,454,932, 24,682,398, 32,909,864, 41,137,330, 49,364,796, 57,592,262, 65,819,728, 74,047,194, 82,274,660
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 2
Divisible by 9No, remainder 8
Divisible by 10No, remainder 6
Divisible by 11No, remainder 5
Divisible by 12No, remainder 2
Divisible by 100No, remainder 66
Collatz (3n + 1) trajectory
Steps to reach 1261the total stopping time
Highest value reached28,146,6883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,227,466 → 4,113,733 → 12,341,200 → 6,170,600 → 3,085,300 → 1,542,650 → 771,325 → 2,313,976 → 1,156,988 → 578,494 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage822,746,600%
8,227,466% as a decimal82,274.66
8,227,466% of 1008,227,466
8,227,466% of 1,00082,274,660
As a fraction of 1008,227,466/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,227,466
Nerdulate something else
Nothing in mind? Surprise me · today’s page