Recognised as Number
3,688,765
- Positive
- Odd
- Composite
- 7 digits
3,688,765 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,688,765
Digit count7
Digit sum43
Digit product241,920
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 737,753
Distinct prime factors25, 737,753
Number of divisors4
Sum of divisors σ(n)4,426,524
Aliquot sum737,759sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,951,008integers below n that share no factor with it
Carmichael function λ(n)737,752the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,951,008
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 737,753, 3,688,7654 in total
Arithmetic
Previous number3,688,764
Next number3,688,766
Double7,377,530
Half1,844,382.5
Square13,606,987,225,225
Cube50,192,978,231,857,097,125
Square root1,920.615786668≈irrational, shown to 9 decimal places
Cube root154.511329521≈
Negation-3,688,765
Reciprocal2.71093442 × 10^-7≈
Representations
Decimal3,688,765
Binary111000010010010011110122 bits
Octal16044475
Hexadecimal38493D
Base 362729P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and eighty-eight thousand, seven hundred and sixty-five
Ordinalthree million, six hundred and eighty-eight thousand, seven hundred and sixty-fifth
Scientific notation3.688765 × 10^6
Engineering notation3.688765 × 10^6
In other bases
Ternary20221102000221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1421020030base 5; one hand: 10 digits
Septenary43232263base 7: 8 digits
Nonary6842027base 9; each digit is two ternary digits: 7 digits
Duodecimal129a851base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1311i5base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:4:39:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T111T0010T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000101100101001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000100100100111101
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 49 3d
Gray code1001000110110110100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000100100100111101
64-bit0000000000000000000000000000000000000000001110000100100100111101
One's complement11111111110001111011011011000010at 32 bits, every bit flipped
Bits reversed10111100100100100001110000000000at 32 bits
Rotated left by 100000000011100001001001001111010at 32 bits, wrapping
Shifted left by 111100001001001001111010= 7,377,530, no wrap
Shifted right by 1111000010010010011110= 1,844,382, discarding the low bit
These bits as a double1.82249206 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,688,765 to the power 213,606,987,225,225
3,688,765 to the power 350,192,978,231,857,097,125
3,688,765 to the power 4185,150,101,347,436,344,876,300,625
3,688,765 to the power 5682,975,213,596,876,028,707,627,074,978,125
First ten multiples3,688,765, 7,377,530, 11,066,295, 14,755,060, 18,443,825, 22,132,590, 25,821,355, 29,510,120, 33,198,885, 36,887,650
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 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 65
Collatz (3n + 1) trajectory
Steps to reach 1141the total stopping time
Highest value reached11,066,2963× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,688,765 → 11,066,296 → 5,533,148 → 2,766,574 → 1,383,287 → 4,149,862 → 2,074,931 → 6,224,794 → 3,112,397 → 9,337,192 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage368,876,500%
3,688,765% as a decimal36,887.65
3,688,765% of 1003,688,765
3,688,765% of 1,00036,887,650
As a fraction of 1003,688,765/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,688,765
Nerdulate something else
Nothing in mind? Surprise me · today’s page