Recognised as Number
3,704,692
- Positive
- Even
- Composite
- 7 digits
3,704,692 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,704,692
Digit count7
Digit sum31
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 numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 29 × 109 × 293
Distinct prime factors42, 29, 109, 293
Number of divisors24
Sum of divisors σ(n)6,791,400
Aliquot sum3,086,708sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,766,016integers below n that share no factor with it
Carmichael function λ(n)55,188the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,766,016
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 29, 58, 109, 116, 218, 293, 436, 586, 1,172, 3,161, 6,322, 8,497, 12,644, 16,994, 31,937, 33,988, 63,874, 127,748, 926,173, 1,852,346, 3,704,69224 in total
Arithmetic
Previous number3,704,691
Next number3,704,693
Double7,409,384
Half1,852,346
Square13,724,742,814,864
Cube50,845,944,908,284,141,888
Square root1,924.757647082≈irrational, shown to 9 decimal places
Cube root154.733388358≈
Negation-3,704,692
Reciprocal2.69927972 × 10^-7≈
Representations
Decimal3,704,692
Binary111000100001110111010022 bits
Octal16103564
Hexadecimal388774
Base 3627EK4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and four thousand, six hundred and ninety-two
Ordinalthree million, seven hundred and four thousand, six hundred and ninety-second
Scientific notation3.704692 × 10^6
Engineering notation3.704692 × 10^6
In other bases
Ternary20222012212211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1422022232base 5; one hand: 10 digits
Septenary43326565base 7: 8 digits
Nonary6865784base 9; each digit is two ternary digits: 7 digits
Duodecimal12a7b04base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1331ecbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:9:4:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T100T1T00T0T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010011001100010110100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110001000011101110100
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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 87 74
Gray code1001001100010011001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110001000011101110100
64-bit0000000000000000000000000000000000000000001110001000011101110100
One's complement11111111110001110111100010001011at 32 bits, every bit flipped
Bits reversed00101110111000010001110000000000at 32 bits
Rotated left by 100000000011100010000111011101000at 32 bits, wrapping
Shifted left by 111100010000111011101000= 7,409,384, no wrap
Shifted right by 1111000100001110111010= 1,852,346, discarding the low bit
These bits as a double1.83036105 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,704,692 to the power 213,724,742,814,864
3,704,692 to the power 350,845,944,908,284,141,888
3,704,692 to the power 4188,368,565,334,160,994,179,338,496
3,704,692 to the power 5697,847,517,044,943,561,848,241,891,423,232
First ten multiples3,704,692, 7,409,384, 11,114,076, 14,818,768, 18,523,460, 22,228,152, 25,932,844, 29,637,536, 33,342,228, 37,046,920
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 5
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11No, remainder 2
Divisible by 12No, remainder 4
Divisible by 100No, remainder 92
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached3,704,692
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,704,692 → 1,852,346 → 926,173 → 2,778,520 → 1,389,260 → 694,630 → 347,315 → 1,041,946 → 520,973 → 1,562,920 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage370,469,200%
3,704,692% as a decimal37,046.92
3,704,692% of 1003,704,692
3,704,692% of 1,00037,046,920
As a fraction of 1003,704,692/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,704,692
Nerdulate something else
Nothing in mind? Surprise me · today’s page