Recognised as Number
8,414,137
- Positive
- Odd
- Prime
- 7 digits
8,414,137 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value8,414,137
Digit count7
Digit sum28
Digit product2,688
Multiplicative persistence6times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation8,414,137
Distinct prime factors18,414,137
Number of divisors2
Sum of divisors σ(n)8,414,138
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,414,136integers below n that share no factor with it
Carmichael function λ(n)8,414,136the 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,1372 in total
Arithmetic
Previous number8,414,136
Next number8,414,138
Double16,828,274
Half4,207,068.5
Square70,797,701,454,769
Cube595,701,559,325,525,669,353
Square root2,900.713188166≈irrational, shown to 9 decimal places
Cube root203.393245506≈
Negation-8,414,137
Reciprocal1.18847601 × 10^-7≈
Representations
Decimal8,414,137
Binary10000000011000111011100124 bits
Octal40061671
Hexadecimal8063B9
Base 3650CE1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, four hundred and fourteen thousand, one hundred and thirty-seven
Ordinaleight million, four hundred and fourteen thousand, one hundred and thirty-seventh
Scientific notation8.414137 × 10^6
Engineering notation8.414137 × 10^6
In other bases
Ternary120211111000201base 3; the most digit-efficient integer base after e: 15 digits
Quinary4123223022base 5; one hand: 10 digits
Septenary131343004base 7: 9 digits
Nonary16744021base 9; each digit is two ternary digits: 8 digits
Duodecimal2999361base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2cbf6hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal38:57:15:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1T11111001T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000011010010011001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100000000110001110111001
Bit length24 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits14within that length
Bit parityeven10 set bits, so even; 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 b9
Gray code110000000101001001100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100000000110001110111001
64-bit0000000000000000000000000000000000000000100000000110001110111001
One's complement11111111011111111001110001000110at 32 bits, every bit flipped
Bits reversed10011101110001100000000100000000at 32 bits
Rotated left by 100000001000000001100011101110010at 32 bits, wrapping
Shifted left by 11000000001100011101110010= 16,828,274, no wrap
Shifted right by 110000000011000111011100= 4,207,068, discarding the low bit
These bits as a double4.15713603 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,414,137 to the power 270,797,701,454,769
8,414,137 to the power 3595,701,559,325,525,669,353
8,414,137 to the power 45,012,314,531,278,600,578,952,843,361
8,414,137 to the power 542,174,301,153,268,930,439,588,540,578,994,457
First ten multiples8,414,137, 16,828,274, 25,242,411, 33,656,548, 42,070,685, 50,484,822, 58,898,959, 67,313,096, 75,727,233, 84,141,370
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached28,397,7163× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,414,137 → 25,242,412 → 12,621,206 → 6,310,603 → 18,931,810 → 9,465,905 → 28,397,716 → 14,198,858 → 7,099,429 → 21,298,288 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage841,413,700%
8,414,137% as a decimal84,141.37
8,414,137% of 1008,414,137
8,414,137% of 1,00084,141,370
As a fraction of 1008,414,137/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,137
Nerdulate something else
Nothing in mind? Surprise me · today’s page