Recognised as Number
3,680,146
- Positive
- Even
- Composite
- 7 digits
3,680,146 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,680,146
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2 × 1,840,073
Distinct prime factors22, 1,840,073
Number of divisors4
Sum of divisors σ(n)5,520,222
Aliquot sum1,840,076sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,840,072integers below n that share no factor with it
Carmichael function λ(n)1,840,072the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 1,840,073, 3,680,1464 in total
Arithmetic
Previous number3,680,145
Next number3,680,147
Double7,360,292
Half1,840,073
Square13,543,474,581,316
Cube49,841,963,806,531,752,136
Square root1,918.370662828≈irrational, shown to 9 decimal places
Cube root154.390894297≈
Negation-3,680,146
Reciprocal2.7172835 × 10^-7≈
Representations
Decimal3,680,146
Binary111000001001111001001022 bits
Octal16023622
Hexadecimal382792
Base 3626VMA
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and eighty thousand, one hundred and forty-six
Ordinalthree million, six hundred and eighty thousand, one hundred and forty-sixth
Scientific notation3.680146 × 10^6
Engineering notation3.680146 × 10^6
In other bases
Ternary20220222012201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1420231041base 5; one hand: 10 digits
Septenary43165201base 7: 8 digits
Nonary6828181base 9; each digit is two ternary digits: 7 digits
Duodecimal129586abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal130076base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:2:15:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T100T1T0T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000111100010010110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000010011110010010
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes338 27 92
Gray code1001000011010001011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000010011110010010
64-bit0000000000000000000000000000000000000000001110000010011110010010
One's complement11111111110001111101100001101101at 32 bits, every bit flipped
Bits reversed01001001111001000001110000000000at 32 bits
Rotated left by 100000000011100000100111100100100at 32 bits, wrapping
Shifted left by 111100000100111100100100= 7,360,292, no wrap
Shifted right by 1111000001001111001001= 1,840,073, discarding the low bit
These bits as a double1.81823371 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,680,146 to the power 213,543,474,581,316
3,680,146 to the power 349,841,963,806,531,752,136
3,680,146 to the power 4183,425,703,734,752,601,496,291,856
3,680,146 to the power 5675,033,369,896,634,847,386,172,488,690,976
First ten multiples3,680,146, 7,360,292, 11,040,438, 14,720,584, 18,400,730, 22,080,876, 25,761,022, 29,441,168, 33,121,314, 36,801,460
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 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10No, remainder 6
Divisible by 11No, remainder 8
Divisible by 12No, remainder 10
Divisible by 100No, remainder 46
Collatz (3n + 1) trajectory
Steps to reach 1203the total stopping time
Highest value reached9,315,3762× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,680,146 → 1,840,073 → 5,520,220 → 2,760,110 → 1,380,055 → 4,140,166 → 2,070,083 → 6,210,250 → 3,105,125 → 9,315,376 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage368,014,600%
3,680,146% as a decimal36,801.46
3,680,146% of 1003,680,146
3,680,146% of 1,00036,801,460
As a fraction of 1003,680,146/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,680,146
Nerdulate something else
Nothing in mind? Surprise me · today’s page