Recognised as Number
3,341,971
- Positive
- Odd
- Prime
- 7 digits
3,341,971 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,341,971
Digit count7
Digit sum28
Digit product2,268
Multiplicative persistence4times 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,341,971
Distinct prime factors13,341,971
Number of divisors2
Sum of divisors σ(n)3,341,972
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,341,970integers below n that share no factor with it
Carmichael function λ(n)3,341,970the 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,9712 in total
Arithmetic
Previous number3,341,970
Next number3,341,972
Double6,683,942
Half1,670,985.5
Square11,168,770,164,841
Cube37,325,705,996,563,841,611
Square root1,828.105850327≈irrational, shown to 9 decimal places
Cube root149.509076529≈
Negation-3,341,971
Reciprocal2.99224619 × 10^-7≈
Representations
Decimal3,341,971
Binary110010111111101001001122 bits
Octal14577223
Hexadecimal32FE93
Base 361ZMOJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and forty-one thousand, nine hundred and seventy-one
Ordinalthree million, three hundred and forty-one thousand, nine hundred and seventy-first
Scientific notation3.341971 × 10^6
Engineering notation3.341971 × 10^6
In other bases
Ternary20021210022201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323420341base 5; one hand: 10 digits
Septenary40256233base 7: 8 digits
Nonary6253281base 9; each digit is two ternary digits: 7 digits
Duodecimal1152017base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10heibbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:28:19:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010TT10100T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110000001110010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101111111010010011
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 fe 93
Gray code1010111000000111011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101111111010010011
64-bit0000000000000000000000000000000000000000001100101111111010010011
One's complement11111111110011010000000101101100at 32 bits, every bit flipped
Bits reversed11001001011111110100110000000000at 32 bits
Rotated left by 100000000011001011111110100100110at 32 bits, wrapping
Shifted left by 111001011111110100100110= 6,683,942, no wrap
Shifted right by 1110010111111101001001= 1,670,985, discarding the low bit
These bits as a double1.65115306 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,341,971 to the power 211,168,770,164,841
3,341,971 to the power 337,325,705,996,563,841,611
3,341,971 to the power 4124,741,426,995,042,458,312,555,281
3,341,971 to the power 5416,882,231,516,049,039,449,268,684,998,851
First ten multiples3,341,971, 6,683,942, 10,025,913, 13,367,884, 16,709,855, 20,051,826, 23,393,797, 26,735,768, 30,077,739, 33,419,710
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 184the total stopping time
Highest value reached15,038,8724× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,341,971 → 10,025,914 → 5,012,957 → 15,038,872 → 7,519,436 → 3,759,718 → 1,879,859 → 5,639,578 → 2,819,789 → 8,459,368 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage334,197,100%
3,341,971% as a decimal33,419.71
3,341,971% of 1003,341,971
3,341,971% of 1,00033,419,710
As a fraction of 1003,341,971/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,971
Nerdulate something else
Nothing in mind? Surprise me · today’s page