Recognised as Number
3,484,979
- Positive
- Odd
- Prime
- 7 digits
3,484,979 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,484,979
Digit count7
Digit sum44
Digit product217,728
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,484,979
Distinct prime factors13,484,979
Number of divisors2
Sum of divisors σ(n)3,484,980
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,484,978integers below n that share no factor with it
Carmichael function λ(n)3,484,978the 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, 3,484,9792 in total
Arithmetic
Previous number3,484,978
Next number3,484,980
Double6,969,958
Half1,742,489.5
Square12,145,078,630,441
Cube42,325,343,980,435,645,739
Square root1,866.809845699≈irrational, shown to 9 decimal places
Cube root151.611934255≈
Negation-3,484,979
Reciprocal2.86945775 × 10^-7≈
Representations
Decimal3,484,979
Binary110101001011010011001122 bits
Octal15226463
Hexadecimal352D33
Base 3622P0Z
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and eighty-four thousand, nine hundred and seventy-nine
Ordinalthree million, four hundred and eighty-four thousand, nine hundred and seventy-ninth
Scientific notation3.484979 × 10^6
Engineering notation3.484979 × 10^6
In other bases
Ternary20120001111022base 3; the most digit-efficient integer base after e: 14 digits
Quinary1343004404base 5; one hand: 10 digits
Septenary41423201base 7: 8 digits
Nonary6501438base 9; each digit is two ternary digits: 7 digits
Duodecimal120092bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11fc8jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:8:2:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT000111110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010111110101110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010010110100110011
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes335 2d 33
Gray code1011111011101110101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010010110100110011
64-bit0000000000000000000000000000000000000000001101010010110100110011
One's complement11111111110010101101001011001100at 32 bits, every bit flipped
Bits reversed11001100101101001010110000000000at 32 bits
Rotated left by 100000000011010100101101001100110at 32 bits, wrapping
Shifted left by 111010100101101001100110= 6,969,958, no wrap
Shifted right by 1110101001011010011001= 1,742,489, discarding the low bit
These bits as a double1.7218084 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,484,979 to the power 212,145,078,630,441
3,484,979 to the power 342,325,343,980,435,645,739
3,484,979 to the power 4147,502,934,939,594,636,251,854,481
3,484,979 to the power 5514,044,630,702,853,575,850,351,577,340,899
First ten multiples3,484,979, 6,969,958, 10,454,937, 13,939,916, 17,424,895, 20,909,874, 24,394,853, 27,879,832, 31,364,811, 34,849,790
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 197the total stopping time
Highest value reached15,682,4084× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,484,979 → 10,454,938 → 5,227,469 → 15,682,408 → 7,841,204 → 3,920,602 → 1,960,301 → 5,880,904 → 2,940,452 → 1,470,226 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage348,497,900%
3,484,979% as a decimal34,849.79
3,484,979% of 1003,484,979
3,484,979% of 1,00034,849,790
As a fraction of 1003,484,979/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,484,979
Nerdulate something else
Nothing in mind? Surprise me · today’s page