Recognised as Number
8,414,141
- Positive
- Odd
- Prime
- 7 digits
8,414,141 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,414,141
Digit count7
Digit sum23
Digit product512
Multiplicative persistence3times 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,414,141
Distinct prime factors18,414,141
Number of divisors2
Sum of divisors σ(n)8,414,142
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,414,140integers below n that share no factor with it
Carmichael function λ(n)8,414,140the 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,414,1412 in total
Arithmetic
Previous number8,414,140
Next number8,414,142
Double16,828,282
Half4,207,070.5
Square70,797,768,767,881
Cube595,702,408,898,347,005,221
Square root2,900.713877651≈irrational, shown to 9 decimal places
Cube root203.393277737≈
Negation-8,414,141
Reciprocal1.18847545 × 10^-7≈
Representations
Decimal8,414,141
Binary10000000011000111011110124 bits
Octal40061675
Hexadecimal8063BD
Base 3650CE5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, four hundred and fourteen thousand, one hundred and forty-one
Ordinaleight million, four hundred and fourteen thousand, one hundred and forty-first
Scientific notation8.414141 × 10^6
Engineering notation8.414141 × 10^6
In other bases
Ternary120211111000212base 3; the most digit-efficient integer base after e: 15 digits
Quinary4123223031base 5; one hand: 10 digits
Septenary131343011base 7: 9 digits
Nonary16744025base 9; each digit is two ternary digits: 8 digits
Duodecimal2999365base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2cbf71base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal38:57:15:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1T111110010TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000011010010011001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100000000110001110111101
Bit length24 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits13within that length
Bit parityodd11 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
Bytes380 63 bd
Gray code110000000101001001100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100000000110001110111101
64-bit0000000000000000000000000000000000000000100000000110001110111101
One's complement11111111011111111001110001000010at 32 bits, every bit flipped
Bits reversed10111101110001100000000100000000at 32 bits
Rotated left by 100000001000000001100011101111010at 32 bits, wrapping
Shifted left by 11000000001100011101111010= 16,828,282, no wrap
Shifted right by 110000000011000111011110= 4,207,070, discarding the low bit
These bits as a double4.15713801 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,414,141 to the power 270,797,768,767,881
8,414,141 to the power 3595,702,408,898,347,005,221
8,414,141 to the power 45,012,324,062,510,346,368,857,230,161
8,414,141 to the power 542,174,401,399,654,868,306,402,743,444,106,701
First ten multiples8,414,141, 16,828,282, 25,242,423, 33,656,564, 42,070,705, 50,484,846, 58,898,987, 67,313,128, 75,727,269, 84,141,410
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1181the total stopping time
Highest value reached80,866,9969× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,414,141 → 25,242,424 → 12,621,212 → 6,310,606 → 3,155,303 → 9,465,910 → 4,732,955 → 14,198,866 → 7,099,433 → 21,298,300 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage841,414,100%
8,414,141% as a decimal84,141.41
8,414,141% of 1008,414,141
8,414,141% of 1,00084,141,410
As a fraction of 1008,414,141/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,414,141
Nerdulate something else
Nothing in mind? Surprise me · today’s page