Recognised as Number
3,341,579
- Positive
- Odd
- Prime
- 7 digits
3,341,579 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 value3,341,579
Digit count7
Digit sum32
Digit product11,340
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,341,579
Distinct prime factors13,341,579
Number of divisors2
Sum of divisors σ(n)3,341,580
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,341,578integers below n that share no factor with it
Carmichael function λ(n)3,341,578the 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,341,5792 in total
Arithmetic
Previous number3,341,578
Next number3,341,580
Double6,683,158
Half1,670,789.5
Square11,166,150,213,241
Cube37,312,573,063,411,647,539
Square root1,827.998632385≈irrational, shown to 9 decimal places
Cube root149.503230692≈
Negation-3,341,579
Reciprocal2.99259721 × 10^-7≈
Representations
Decimal3,341,579
Binary110010111111010000101122 bits
Octal14576413
Hexadecimal32FD0B
Base 361ZMDN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and forty-one thousand, five hundred and seventy-nine
Ordinalthree million, three hundred and forty-one thousand, five hundred and seventy-ninth
Scientific notation3.341579 × 10^6
Engineering notation3.341579 × 10^6
In other bases
Ternary20021202210012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323412304base 5; one hand: 10 digits
Septenary40255133base 7: 8 digits
Nonary6252705base 9; each digit is two ternary digits: 7 digits
Duodecimal115194bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10hdijbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:28:12:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010TT10T101TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110000110100011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101111110100001011
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; 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 fd 0b
Gray code1010111000001110001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101111110100001011
64-bit0000000000000000000000000000000000000000001100101111110100001011
One's complement11111111110011010000001011110100at 32 bits, every bit flipped
Bits reversed11010000101111110100110000000000at 32 bits
Rotated left by 100000000011001011111101000010110at 32 bits, wrapping
Shifted left by 111001011111101000010110= 6,683,158, no wrap
Shifted right by 1110010111111010000101= 1,670,789, discarding the low bit
These bits as a double1.65095939 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,341,579 to the power 211,166,150,213,241
3,341,579 to the power 337,312,573,063,411,647,539
3,341,579 to the power 4124,682,910,584,662,029,771,724,081
3,341,579 to the power 5416,637,795,668,584,360,782,567,982,863,899
First ten multiples3,341,579, 6,683,158, 10,024,737, 13,366,316, 16,707,895, 20,049,474, 23,391,053, 26,732,632, 30,074,211, 33,415,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 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 184the total stopping time
Highest value reached15,037,1084× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,341,579 → 10,024,738 → 5,012,369 → 15,037,108 → 7,518,554 → 3,759,277 → 11,277,832 → 5,638,916 → 2,819,458 → 1,409,729 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage334,157,900%
3,341,579% as a decimal33,415.79
3,341,579% of 1003,341,579
3,341,579% of 1,00033,415,790
As a fraction of 1003,341,579/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,341,579
Nerdulate something else
Nothing in mind? Surprise me · today’s page