Recognised as Number
3,687,485
- Positive
- Odd
- Composite
- 7 digits
3,687,485 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,687,485
Digit count7
Digit sum41
Digit product161,280
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 737,497
Distinct prime factors25, 737,497
Number of divisors4
Sum of divisors σ(n)4,424,988
Aliquot sum737,503sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,949,984integers below n that share no factor with it
Carmichael function λ(n)737,496the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,949,984
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 737,497, 3,687,4854 in total
Arithmetic
Previous number3,687,484
Next number3,687,486
Double7,374,970
Half1,843,742.5
Square13,597,545,625,225
Cube50,140,745,529,832,809,125
Square root1,920.282531296≈irrational, shown to 9 decimal places
Cube root154.493455663≈
Negation-3,687,485
Reciprocal2.71187544 × 10^-7≈
Representations
Decimal3,687,485
Binary111000010001000011110122 bits
Octal16042075
Hexadecimal38443D
Base 36271A5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and eighty-seven thousand, four hundred and eighty-five
Ordinalthree million, six hundred and eighty-seven thousand, four hundred and eighty-fifth
Scientific notation3.687485 × 10^6
Engineering notation3.687485 × 10^6
In other bases
Ternary20221100021112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1420444420base 5; one hand: 10 digits
Septenary43225454base 7: 8 digits
Nonary6840245base 9; each digit is two ternary digits: 7 digits
Duodecimal1299b65base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal130ie5base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:4:18:5base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T110010TTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000100010001001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000100010000111101
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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 44 3d
Gray code1001000110011000100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000100010000111101
64-bit0000000000000000000000000000000000000000001110000100010000111101
One's complement11111111110001111011101111000010at 32 bits, every bit flipped
Bits reversed10111100001000100001110000000000at 32 bits
Rotated left by 100000000011100001000100001111010at 32 bits, wrapping
Shifted left by 111100001000100001111010= 7,374,970, no wrap
Shifted right by 1111000010001000011110= 1,843,742, discarding the low bit
These bits as a double1.82185966 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,687,485 to the power 213,597,545,625,225
3,687,485 to the power 350,140,745,529,832,809,125
3,687,485 to the power 4184,893,247,030,075,536,156,300,625
3,687,485 to the power 5681,791,075,024,698,088,443,316,210,178,125
First ten multiples3,687,485, 7,374,970, 11,062,455, 14,749,940, 18,437,425, 22,124,910, 25,812,395, 29,499,880, 33,187,365, 36,874,850
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 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 5
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 85
Collatz (3n + 1) trajectory
Steps to reach 1172the total stopping time
Highest value reached11,062,4563× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,687,485 → 11,062,456 → 5,531,228 → 2,765,614 → 1,382,807 → 4,148,422 → 2,074,211 → 6,222,634 → 3,111,317 → 9,333,952 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage368,748,500%
3,687,485% as a decimal36,874.85
3,687,485% of 1003,687,485
3,687,485% of 1,00036,874,850
As a fraction of 1003,687,485/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,485
Nerdulate something else
Nothing in mind? Surprise me · today’s page