Recognised as Number
3,301,672
- Positive
- Even
- Composite
- 7 digits
3,301,672 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,301,672
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 11 × 17 × 2,207
Distinct prime factors42, 11, 17, 2,207
Number of divisors32
Sum of divisors σ(n)7,153,920
Aliquot sum3,852,248sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,411,840integers below n that share no factor with it
Carmichael function λ(n)88,240the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,411,840
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 11, 17, 22, 34, 44, 68, 88, 136, 187, 374, 748, 1,496, 2,207, 4,414, 8,828, 17,656, 24,277, 37,519, 48,554, 75,038, 97,108, 150,076, 194,216, 300,152, 412,709, 825,418, 1,650,836, 3,301,67232 in total
Arithmetic
Previous number3,301,671
Next number3,301,673
Double6,603,344
Half1,650,836
Square10,901,037,995,584
Cube35,991,651,920,955,816,448
Square root1,817.050357035≈irrational, shown to 9 decimal places
Cube root148.905695322≈
Negation-3,301,672
Reciprocal3.02876845 × 10^-7≈
Representations
Decimal3,301,672
Binary110010011000010010100022 bits
Octal14460450
Hexadecimal326128
Base 361YRL4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and one thousand, six hundred and seventy-two
Ordinalthree million, three hundred and one thousand, six hundred and seventy-second
Scientific notation3.301672 × 10^6
Engineering notation3.301672 × 10^6
In other bases
Ternary20012202001011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1321123142base 5; one hand: 10 digits
Septenary40030603base 7: 8 digits
Nonary6182034base 9; each digit is two ternary digits: 7 digits
Duodecimal1132834base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10ce3cbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:17:7:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T0T1T001011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111010000101111000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100100110000100101000
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes332 61 28
Gray code1010110101000110111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100100110000100101000
64-bit0000000000000000000000000000000000000000001100100110000100101000
One's complement11111111110011011001111011010111at 32 bits, every bit flipped
Bits reversed00010100100001100100110000000000at 32 bits
Rotated left by 100000000011001001100001001010000at 32 bits, wrapping
Shifted left by 111001001100001001010000= 6,603,344, no wrap
Shifted right by 1110010011000010010100= 1,650,836, discarding the low bit
These bits as a double1.63124271 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,301,672 to the power 210,901,037,995,584
3,301,672 to the power 335,991,651,920,955,816,448
3,301,672 to the power 4118,832,629,381,166,032,403,501,056
3,301,672 to the power 5392,346,365,114,173,216,537,732,138,565,632
First ten multiples3,301,672, 6,603,344, 9,905,016, 13,206,688, 16,508,360, 19,810,032, 23,111,704, 26,413,376, 29,715,048, 33,016,720
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8Yes
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11Yes
Divisible by 12No, remainder 4
Divisible by 100No, remainder 72
Collatz (3n + 1) trajectory
Steps to reach 184the total stopping time
Highest value reached3,301,672
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,301,672 → 1,650,836 → 825,418 → 412,709 → 1,238,128 → 619,064 → 309,532 → 154,766 → 77,383 → 232,150 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage330,167,200%
3,301,672% as a decimal33,016.72
3,301,672% of 1003,301,672
3,301,672% of 1,00033,016,720
As a fraction of 1003,301,672/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,301,672
Nerdulate something else
Nothing in mind? Surprise me · today’s page