Recognised as Number
3,681,092
- Positive
- Even
- Composite
- 7 digits
3,681,092 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,681,092
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 920,273
Distinct prime factors22, 920,273
Number of divisors6
Sum of divisors σ(n)6,441,918
Aliquot sum2,760,826sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,840,544integers below n that share no factor with it
Carmichael function λ(n)920,272the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,840,544
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 920,273, 1,840,546, 3,681,0926 in total
Arithmetic
Previous number3,681,091
Next number3,681,093
Double7,362,184
Half1,840,546
Square13,550,438,312,464
Cube49,880,410,068,504,730,688
Square root1,918.617210389≈irrational, shown to 9 decimal places
Cube root154.404122148≈
Negation-3,681,092
Reciprocal2.71658519 × 10^-7≈
Representations
Decimal3,681,092
Binary111000001010110100010022 bits
Octal16025504
Hexadecimal382B44
Base 3626WCK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and eighty-one thousand and ninety-two
Ordinalthree million, six hundred and eighty-one thousand and ninety-second
Scientific notation3.681092 × 10^6
Engineering notation3.681092 × 10^6
In other bases
Ternary20221000111202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1420243332base 5; one hand: 10 digits
Septenary43201022base 7: 8 digits
Nonary6830452base 9; each digit is two ternary digits: 7 digits
Duodecimal1296318base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1302ecbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:2:31:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T1001TTTT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000111111101000100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000010101101000100
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes338 2b 44
Gray code1001000011111011100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000010101101000100
64-bit0000000000000000000000000000000000000000001110000010101101000100
One's complement11111111110001111101010010111011at 32 bits, every bit flipped
Bits reversed00100010110101000001110000000000at 32 bits
Rotated left by 100000000011100000101011010001000at 32 bits, wrapping
Shifted left by 111100000101011010001000= 7,362,184, no wrap
Shifted right by 1111000001010110100010= 1,840,546, discarding the low bit
These bits as a double1.8187011 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,681,092 to the power 213,550,438,312,464
3,681,092 to the power 349,880,410,068,504,730,688
3,681,092 to the power 4183,614,378,459,892,216,097,751,296
3,681,092 to the power 5675,901,419,633,681,557,539,703,513,695,232
First ten multiples3,681,092, 7,362,184, 11,043,276, 14,724,368, 18,405,460, 22,086,552, 25,767,644, 29,448,736, 33,129,828, 36,810,920
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 8
Divisible by 12No, remainder 8
Divisible by 100No, remainder 92
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached8,510,3442× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,681,092 → 1,840,546 → 920,273 → 2,760,820 → 1,380,410 → 690,205 → 2,070,616 → 1,035,308 → 517,654 → 258,827 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage368,109,200%
3,681,092% as a decimal36,810.92
3,681,092% of 1003,681,092
3,681,092% of 1,00036,810,920
As a fraction of 1003,681,092/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,681,092
Nerdulate something else
Nothing in mind? Surprise me · today’s page