Recognised as Number
3,704,537
- Positive
- Odd
- Prime
- 7 digits
3,704,537 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,704,537
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 factorisation3,704,537
Distinct prime factors13,704,537
Number of divisors2
Sum of divisors σ(n)3,704,538
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,704,536integers below n that share no factor with it
Carmichael function λ(n)3,704,536the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3,704,5372 in total
Arithmetic
Previous number3,704,536
Next number3,704,538
Double7,409,074
Half1,852,268.5
Square13,723,594,384,369
Cube50,839,563,169,887,182,153
Square root1,924.717381851≈irrational, shown to 9 decimal places
Cube root154.731230373≈
Negation-3,704,537
Reciprocal2.69939266 × 10^-7≈
Representations
Decimal3,704,537
Binary111000100001101101100122 bits
Octal16103331
Hexadecimal3886D9
Base 3627EFT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and four thousand, five hundred and thirty-seven
Ordinalthree million, seven hundred and four thousand, five hundred and thirty-seventh
Scientific notation3.704537 × 10^6
Engineering notation3.704537 × 10^6
In other bases
Ternary20222012200002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1422021122base 5; one hand: 10 digits
Septenary43326254base 7: 8 digits
Nonary6865602base 9; each digit is two ternary digits: 7 digits
Duodecimal12a79b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal13316hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:9:2:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T100T1T0T0001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010011001101100101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110001000011011011001
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes338 86 d9
Gray code1001001100010110110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110001000011011011001
64-bit0000000000000000000000000000000000000000001110001000011011011001
One's complement11111111110001110111100100100110at 32 bits, every bit flipped
Bits reversed10011011011000010001110000000000at 32 bits
Rotated left by 100000000011100010000110110110010at 32 bits, wrapping
Shifted left by 111100010000110110110010= 7,409,074, no wrap
Shifted right by 1111000100001101101100= 1,852,268, discarding the low bit
These bits as a double1.83028447 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,704,537 to the power 213,723,594,384,369
3,704,537 to the power 350,839,563,169,887,182,153
3,704,537 to the power 4188,337,042,826,684,352,111,528,161
3,704,537 to the power 5697,701,543,622,036,769,718,184,198,966,457
First ten multiples3,704,537, 7,409,074, 11,113,611, 14,818,148, 18,522,685, 22,227,222, 25,931,759, 29,636,296, 33,340,833, 37,045,370
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 184the total stopping time
Highest value reached12,502,8163× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,704,537 → 11,113,612 → 5,556,806 → 2,778,403 → 8,335,210 → 4,167,605 → 12,502,816 → 6,251,408 → 3,125,704 → 1,562,852 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage370,453,700%
3,704,537% as a decimal37,045.37
3,704,537% of 1003,704,537
3,704,537% of 1,00037,045,370
As a fraction of 1003,704,537/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,537
Nerdulate something else
Nothing in mind? Surprise me · today’s page