Recognised as Number
3,704,691
- Positive
- Odd
- Composite
- 7 digits
3,704,691 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,704,691
Digit count7
Digit sum30
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 17^2 × 4,273
Distinct prime factors33, 17, 4,273
Number of divisors12
Sum of divisors σ(n)5,248,472
Aliquot sum1,543,781sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,323,968integers below n that share no factor with it
Carmichael function λ(n)72,624the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,323,968
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 17, 51, 289, 867, 4,273, 12,819, 72,641, 217,923, 1,234,897, 3,704,69112 in total
Arithmetic
Previous number3,704,690
Next number3,704,692
Double7,409,382
Half1,852,345.5
Square13,724,735,405,481
Cube50,845,903,734,066,811,371
Square root1,924.757387309≈irrational, shown to 9 decimal places
Cube root154.733374436≈
Negation-3,704,691
Reciprocal2.69928045 × 10^-7≈
Representations
Decimal3,704,691
Binary111000100001110111001122 bits
Octal16103563
Hexadecimal388773
Base 3627EK3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and four thousand, six hundred and ninety-one
Ordinalthree million, seven hundred and four thousand, six hundred and ninety-first
Scientific notation3.704691 × 10^6
Engineering notation3.704691 × 10^6
In other bases
Ternary20222012212210base 3; the most digit-efficient integer base after e: 14 digits
Quinary1422022231base 5; one hand: 10 digits
Septenary43326564base 7: 8 digits
Nonary6865783base 9; each digit is two ternary digits: 7 digits
Duodecimal12a7b03base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1331ebbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:9:4:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T100T1T00T0T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010011001100010110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110001000011101110011
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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
Bytes338 87 73
Gray code1001001100010011001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110001000011101110011
64-bit0000000000000000000000000000000000000000001110001000011101110011
One's complement11111111110001110111100010001100at 32 bits, every bit flipped
Bits reversed11001110111000010001110000000000at 32 bits
Rotated left by 100000000011100010000111011100110at 32 bits, wrapping
Shifted left by 111100010000111011100110= 7,409,382, no wrap
Shifted right by 1111000100001110111001= 1,852,345, discarding the low bit
These bits as a double1.83036055 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,704,691 to the power 213,724,735,405,481
3,704,691 to the power 350,845,903,734,066,811,371
3,704,691 to the power 4188,368,361,950,463,709,484,841,361
3,704,691 to the power 5697,846,575,202,625,350,355,106,426,524,451
First ten multiples3,704,691, 7,409,382, 11,114,073, 14,818,764, 18,523,455, 22,228,146, 25,932,837, 29,637,528, 33,342,219, 37,046,910
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 3
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 184the total stopping time
Highest value reached16,671,1124× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,704,691 → 11,114,074 → 5,557,037 → 16,671,112 → 8,335,556 → 4,167,778 → 2,083,889 → 6,251,668 → 3,125,834 → 1,562,917 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage370,469,100%
3,704,691% as a decimal37,046.91
3,704,691% of 1003,704,691
3,704,691% of 1,00037,046,910
As a fraction of 1003,704,691/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,691
Nerdulate something else
Nothing in mind? Surprise me · today’s page