Recognised as Number
3,687,049
- Positive
- Odd
- Prime
- 7 digits
3,687,049 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,687,049
Digit count7
Digit sum37
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 factorisation3,687,049
Distinct prime factors13,687,049
Number of divisors2
Sum of divisors σ(n)3,687,050
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,687,048integers below n that share no factor with it
Carmichael function λ(n)3,687,048the 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,687,0492 in total
Arithmetic
Previous number3,687,048
Next number3,687,050
Double7,374,098
Half1,843,524.5
Square13,594,330,328,401
Cube50,122,962,043,000,578,649
Square root1,920.169002979≈irrational, shown to 9 decimal places
Cube root154.487366436≈
Negation-3,687,049
Reciprocal2.71219612 × 10^-7≈
Representations
Decimal3,687,049
Binary111000010000101000100122 bits
Octal16041211
Hexadecimal384289
Base 36270Y1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and eighty-seven thousand and forty-nine
Ordinalthree million, six hundred and eighty-seven thousand and forty-ninth
Scientific notation3.687049 × 10^6
Engineering notation3.687049 × 10^6
In other bases
Ternary20221022200101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1420441144base 5; one hand: 10 digits
Septenary43224262base 7: 8 digits
Nonary6838611base 9; each digit is two ternary digits: 7 digits
Duodecimal1299861base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal130hc9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:4:10:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T1100T00101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000100011110011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000100001010001001
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 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 42 89
Gray code1001000110001111001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000100001010001001
64-bit0000000000000000000000000000000000000000001110000100001010001001
One's complement11111111110001111011110101110110at 32 bits, every bit flipped
Bits reversed10010001010000100001110000000000at 32 bits
Rotated left by 100000000011100001000010100010010at 32 bits, wrapping
Shifted left by 111100001000010100010010= 7,374,098, no wrap
Shifted right by 1111000010000101000100= 1,843,524, discarding the low bit
These bits as a double1.82164425 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,687,049 to the power 213,594,330,328,401
3,687,049 to the power 350,122,962,043,000,578,649
3,687,049 to the power 4184,805,817,077,683,240,507,216,801
3,687,049 to the power 5681,388,103,050,454,914,228,893,198,910,249
First ten multiples3,687,049, 7,374,098, 11,061,147, 14,748,196, 18,435,245, 22,122,294, 25,809,343, 29,496,392, 33,183,441, 36,870,490
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1265the total stopping time
Highest value reached39,865,12010× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,687,049 → 11,061,148 → 5,530,574 → 2,765,287 → 8,295,862 → 4,147,931 → 12,443,794 → 6,221,897 → 18,665,692 → 9,332,846 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage368,704,900%
3,687,049% as a decimal36,870.49
3,687,049% of 1003,687,049
3,687,049% of 1,00036,870,490
As a fraction of 1003,687,049/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,687,049
Nerdulate something else
Nothing in mind? Surprise me · today’s page