Recognised as Number
8,049,487
- Positive
- Odd
- Prime
- 7 digits
8,049,487 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value8,049,487
Digit count7
Digit sum40
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation8,049,487
Distinct prime factors18,049,487
Number of divisors2
Sum of divisors σ(n)8,049,488
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,049,486integers below n that share no factor with it
Carmichael function λ(n)8,049,486the 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,049,4872 in total
Arithmetic
Previous number8,049,486
Next number8,049,488
Double16,098,974
Half4,024,743.5
Square64,794,240,963,169
Cube521,560,400,307,896,344,303
Square root2,837.161786011≈irrational, shown to 9 decimal places
Cube root200.411544242≈
Negation-8,049,487
Reciprocal1.24231519 × 10^-7≈
Representations
Decimal8,049,487
Binary1111010110100110100111123 bits
Octal36551517
Hexadecimal7AD34F
Base 364SJ0V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, forty-nine thousand, four hundred and eighty-seven
Ordinaleight million, forty-nine thousand, four hundred and eighty-seventh
Scientific notation8.049487 × 10^6
Engineering notation8.049487 × 10^6
In other bases
Ternary120010221211011base 3; the most digit-efficient integer base after e: 15 digits
Quinary4030040422base 5; one hand: 10 digits
Septenary125263615base 7: 9 digits
Nonary16127734base 9; each digit is two ternary digits: 8 digits
Duodecimal2842327base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2a63e7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal37:15:58:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT001100TT11011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100011111101011101010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011110101101001101001111
Bit length23 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits8within that length
Bit parityodd15 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 d3 4f
Gray code10001111011101011101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011110101101001101001111
64-bit0000000000000000000000000000000000000000011110101101001101001111
One's complement11111111100001010010110010110000at 32 bits, every bit flipped
Bits reversed11110010110010110101111000000000at 32 bits
Rotated left by 100000000111101011010011010011110at 32 bits, wrapping
Shifted left by 1111101011010011010011110= 16,098,974, no wrap
Shifted right by 11111010110100110100111= 4,024,743, discarding the low bit
These bits as a double3.97697499 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,049,487 to the power 264,794,240,963,169
8,049,487 to the power 3521,560,400,307,896,344,303
8,049,487 to the power 44,198,293,661,993,207,620,814,522,561
8,049,487 to the power 533,794,110,254,396,718,832,047,428,765,976,207
First ten multiples8,049,487, 16,098,974, 24,148,461, 32,197,948, 40,247,435, 48,296,922, 56,346,409, 64,395,896, 72,445,383, 80,494,870
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1261the total stopping time
Highest value reached81,501,06410× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,049,487 → 24,148,462 → 12,074,231 → 36,222,694 → 18,111,347 → 54,334,042 → 27,167,021 → 81,501,064 → 40,750,532 → 20,375,266 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage804,948,700%
8,049,487% as a decimal80,494.87
8,049,487% of 1008,049,487
8,049,487% of 1,00080,494,870
As a fraction of 1008,049,487/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,049,487
Nerdulate something else
Nothing in mind? Surprise me · today’s page