Recognised as Number
3,848,704
- Positive
- Even
- Composite
- 7 digits
3,848,704 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,848,704
Digit count7
Digit sum34
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^9 × 7,517
Distinct prime factors22, 7,517
Number of divisors20
Sum of divisors σ(n)7,690,914
Aliquot sum3,842,210sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,924,096integers below n that share no factor with it
Carmichael function λ(n)240,512the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,924,096
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 7,517, 15,034, 30,068, 60,136, 120,272, 240,544, 481,088, 962,176, 1,924,352, 3,848,70420 in total
Arithmetic
Previous number3,848,703
Next number3,848,705
Double7,697,408
Half1,924,352
Square14,812,522,479,616
Cube57,009,014,517,388,017,664
Square root1,961.811407858≈irrational, shown to 9 decimal places
Cube root156.712932365≈
Negation-3,848,704
Reciprocal2.59827724 × 10^-7≈
Representations
Decimal3,848,704
Binary111010101110100000000022 bits
Octal16535000
Hexadecimal3ABA00
Base 362AHOG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, eight hundred and forty-eight thousand, seven hundred and four
Ordinalthree million, eight hundred and forty-eight thousand, seven hundred and fourth
Scientific notation3.848704 × 10^6
Engineering notation3.848704 × 10^6
In other bases
Ternary21020112102121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1441124304base 5; one hand: 10 digits
Septenary44466466base 7: 8 digits
Nonary7215377base 9; each digit is two ternary digits: 7 digits
Duodecimal1357314base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1411f4base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:49:5:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11T1TTT110TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011111100111000000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110101011101000000000
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 99 trailing zeros
Power of twoNo
Bytes33a ba 00
Gray code1001111110011100000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110101011101000000000
64-bit0000000000000000000000000000000000000000001110101011101000000000
One's complement11111111110001010100010111111111at 32 bits, every bit flipped
Bits reversed00000000010111010101110000000000at 32 bits
Rotated left by 100000000011101010111010000000000at 32 bits, wrapping
Shifted left by 111101010111010000000000= 7,697,408, no wrap
Shifted right by 1111010101110100000000= 1,924,352, discarding the low bit
These bits as a double1.90151243 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,848,704 to the power 214,812,522,479,616
3,848,704 to the power 357,009,014,517,388,017,664
3,848,704 to the power 4219,410,822,209,129,333,135,507,456
3,848,704 to the power 5844,447,309,079,564,900,955,960,087,937,024
First ten multiples3,848,704, 7,697,408, 11,546,112, 15,394,816, 19,243,520, 23,092,224, 26,940,928, 30,789,632, 34,638,336, 38,487,040
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 4
Divisible by 11No, remainder 2
Divisible by 12No, remainder 4
Divisible by 100No, remainder 4
Collatz (3n + 1) trajectory
Steps to reach 197the total stopping time
Highest value reached3,848,704
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,848,704 → 1,924,352 → 962,176 → 481,088 → 240,544 → 120,272 → 60,136 → 30,068 → 15,034 → 7,517 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage384,870,400%
3,848,704% as a decimal38,487.04
3,848,704% of 1003,848,704
3,848,704% of 1,00038,487,040
As a fraction of 1003,848,704/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 3,848,704
Nerdulate something else
Nothing in mind? Surprise me · today’s page