Recognised as Number
3,341,973
- Positive
- Odd
- Composite
- 7 digits
3,341,973 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,341,973
Digit count7
Digit sum30
Digit product6,804
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 1,113,991
Distinct prime factors23, 1,113,991
Number of divisors4
Sum of divisors σ(n)4,455,968
Aliquot sum1,113,995sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,227,980integers below n that share no factor with it
Carmichael function λ(n)1,113,990the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,227,980
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 1,113,991, 3,341,9734 in total
Arithmetic
Previous number3,341,972
Next number3,341,974
Double6,683,946
Half1,670,986.5
Square11,168,783,532,729
Cube37,325,773,009,224,934,317
Square root1,828.106397341≈irrational, shown to 9 decimal places
Cube root149.509106353≈
Negation-3,341,973
Reciprocal2.9922444 × 10^-7≈
Representations
Decimal3,341,973
Binary110010111111101001010122 bits
Octal14577225
Hexadecimal32FE95
Base 361ZMOL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and forty-one thousand, nine hundred and seventy-three
Ordinalthree million, three hundred and forty-one thousand, nine hundred and seventy-third
Scientific notation3.341973 × 10^6
Engineering notation3.341973 × 10^6
In other bases
Ternary20021210022210base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323420343base 5; one hand: 10 digits
Septenary40256235base 7: 8 digits
Nonary6253283base 9; each digit is two ternary digits: 7 digits
Duodecimal1152019base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10heidbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:28:19:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010TT10100T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110000001110010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101111111010010101
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 95
Gray code1010111000000111011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101111111010010101
64-bit0000000000000000000000000000000000000000001100101111111010010101
One's complement11111111110011010000000101101010at 32 bits, every bit flipped
Bits reversed10101001011111110100110000000000at 32 bits
Rotated left by 100000000011001011111110100101010at 32 bits, wrapping
Shifted left by 111001011111110100101010= 6,683,946, no wrap
Shifted right by 1110010111111101001010= 1,670,986, discarding the low bit
These bits as a double1.65115405 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,341,973 to the power 211,168,783,532,729
3,341,973 to the power 337,325,773,009,224,934,317
3,341,973 to the power 4124,741,725,600,958,481,414,187,441
3,341,973 to the power 5416,883,478,931,812,019,007,216,244,761,093
First ten multiples3,341,973, 6,683,946, 10,025,919, 13,367,892, 16,709,865, 20,051,838, 23,393,811, 26,735,784, 30,077,757, 33,419,730
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 184the total stopping time
Highest value reached10,025,9203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,341,973 → 10,025,920 → 5,012,960 → 2,506,480 → 1,253,240 → 626,620 → 313,310 → 156,655 → 469,966 → 234,983 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage334,197,300%
3,341,973% as a decimal33,419.73
3,341,973% of 1003,341,973
3,341,973% of 1,00033,419,730
As a fraction of 1003,341,973/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,973
Nerdulate something else
Nothing in mind? Surprise me · today’s page