Recognised as Number
3,334,879
- Positive
- Odd
- Prime
- 7 digits
3,334,879 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 value3,334,879
Digit count7
Digit sum37
Digit product54,432
Multiplicative persistence3times 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 factorisation3,334,879
Distinct prime factors13,334,879
Number of divisors2
Sum of divisors σ(n)3,334,880
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,334,878integers below n that share no factor with it
Carmichael function λ(n)3,334,878the 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,334,8792 in total
Arithmetic
Previous number3,334,878
Next number3,334,880
Double6,669,758
Half1,667,439.5
Square11,121,417,944,641
Cube37,088,583,153,806,433,439
Square root1,826.165107541≈irrational, shown to 9 decimal places
Cube root149.403243844≈
Negation-3,334,879
Reciprocal2.99860954 × 10^-7≈
Representations
Decimal3,334,879
Binary110010111000101101111122 bits
Octal14561337
Hexadecimal32E2DF
Base 361ZH7J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and thirty-four thousand, eight hundred and seventy-nine
Ordinalthree million, three hundred and thirty-four thousand, eight hundred and seventy-ninth
Scientific notation3.334879 × 10^6
Engineering notation3.334879 × 10^6
In other bases
Ternary20021102121001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323204004base 5; one hand: 10 digits
Septenary40226452base 7: 8 digits
Nonary6242531base 9; each digit is two ternary digits: 7 digits
Duodecimal1149aa7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10gh3jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:26:21:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T1110TT1001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110010011100100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101110001011011111
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 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
Bytes332 e2 df
Gray code1010111001001110110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101110001011011111
64-bit0000000000000000000000000000000000000000001100101110001011011111
One's complement11111111110011010001110100100000at 32 bits, every bit flipped
Bits reversed11111011010001110100110000000000at 32 bits
Rotated left by 100000000011001011100010110111110at 32 bits, wrapping
Shifted left by 111001011100010110111110= 6,669,758, no wrap
Shifted right by 1110010111000101101111= 1,667,439, discarding the low bit
These bits as a double1.64764915 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,334,879 to the power 211,121,417,944,641
3,334,879 to the power 337,088,583,153,806,433,439
3,334,879 to the power 4123,685,937,099,382,844,940,618,881
3,334,879 to the power 5412,477,634,228,052,762,552,726,153,250,399
First ten multiples3,334,879, 6,669,758, 10,004,637, 13,339,516, 16,674,395, 20,009,274, 23,344,153, 26,679,032, 30,013,911, 33,348,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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1177the total stopping time
Highest value reached50,648,48815× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,334,879 → 10,004,638 → 5,002,319 → 15,006,958 → 7,503,479 → 22,510,438 → 11,255,219 → 33,765,658 → 16,882,829 → 50,648,488 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage333,487,900%
3,334,879% as a decimal33,348.79
3,334,879% of 1003,334,879
3,334,879% of 1,00033,348,790
As a fraction of 1003,334,879/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,334,879
Nerdulate something else
Nothing in mind? Surprise me · today’s page