Recognised as Number
8,048,147
- Positive
- Odd
- Prime
- 7 digits
8,048,147 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,048,147
Digit count7
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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,048,147
Distinct prime factors18,048,147
Number of divisors2
Sum of divisors σ(n)8,048,148
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,048,146integers below n that share no factor with it
Carmichael function λ(n)8,048,146the 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,048,1472 in total
Arithmetic
Previous number8,048,146
Next number8,048,148
Double16,096,294
Half4,024,073.5
Square64,772,670,133,609
Cube521,299,970,817,794,872,523
Square root2,836.925624686≈irrational, shown to 9 decimal places
Cube root200.400422773≈
Negation-8,048,147
Reciprocal1.24252204 × 10^-7≈
Representations
Decimal8,048,147
Binary1111010110011100001001123 bits
Octal36547023
Hexadecimal7ACE13
Base 364SHZN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, forty-eight thousand, one hundred and forty-seven
Ordinaleight million, forty-eight thousand, one hundred and forty-seventh
Scientific notation8.048147 × 10^6
Engineering notation8.048147 × 10^6
In other bases
Ternary120010212222112base 3; the most digit-efficient integer base after e: 15 digits
Quinary4030020042base 5; one hand: 10 digits
Septenary125256662base 7: 9 digits
Nonary16125875base 9; each digit is two ternary digits: 8 digits
Duodecimal28415abbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2a6077base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal37:15:35:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT00110T0000TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100011111101001000010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011110101100111000010011
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 ce 13
Gray code10001111010100100011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011110101100111000010011
64-bit0000000000000000000000000000000000000000011110101100111000010011
One's complement11111111100001010011000111101100at 32 bits, every bit flipped
Bits reversed11001000011100110101111000000000at 32 bits
Rotated left by 100000000111101011001110000100110at 32 bits, wrapping
Shifted left by 1111101011001110000100110= 16,096,294, no wrap
Shifted right by 11111010110011100001001= 4,024,073, discarding the low bit
These bits as a double3.97631295 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,048,147 to the power 264,772,670,133,609
8,048,147 to the power 3521,299,970,817,794,872,523
8,048,147 to the power 44,195,498,796,237,323,349,911,364,881
8,048,147 to the power 533,765,991,050,441,025,206,619,101,532,925,507
First ten multiples8,048,147, 16,096,294, 24,144,441, 32,192,588, 40,240,735, 48,288,882, 56,337,029, 64,385,176, 72,433,323, 80,481,470
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1168the total stopping time
Highest value reached38,674,7444× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,048,147 → 24,144,442 → 12,072,221 → 36,216,664 → 18,108,332 → 9,054,166 → 4,527,083 → 13,581,250 → 6,790,625 → 20,371,876 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage804,814,700%
8,048,147% as a decimal80,481.47
8,048,147% of 1008,048,147
8,048,147% of 1,00080,481,470
As a fraction of 1008,048,147/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,048,147
Nerdulate something else
Nothing in mind? Surprise me · today’s page