Recognised as Number
3,681,755
- Positive
- Odd
- Composite
- 7 digits
3,681,755 is an odd 7-digit integer and a composite number. It has 32 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,681,755
Digit count7
Digit sum35
Digit product25,200
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 7 × 11 × 73 × 131
Distinct prime factors55, 7, 11, 73, 131
Number of divisors32
Sum of divisors σ(n)5,626,368
Aliquot sum1,944,613sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,246,400integers below n that share no factor with it
Carmichael function λ(n)4,680the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,246,400
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 7, 11, 35, 55, 73, 77, 131, 365, 385, 511, 655, 803, 917, 1,441, 2,555, 4,015, 4,585, 5,621, 7,205, 9,563, 10,087, 28,105, 47,815, 50,435, 66,941, 105,193, 334,705, 525,965, 736,351, 3,681,75532 in total
Arithmetic
Previous number3,681,754
Next number3,681,756
Double7,363,510
Half1,840,877.5
Square13,555,319,880,025
Cube49,907,366,744,881,443,875
Square root1,918.789983297≈irrational, shown to 9 decimal places
Cube root154.41339148≈
Negation-3,681,755
Reciprocal2.71609599 × 10^-7≈
Representations
Decimal3,681,755
Binary111000001011011101101122 bits
Octal16026733
Hexadecimal382DDB
Base 3626WUZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and eighty-one thousand, seven hundred and fifty-five
Ordinalthree million, six hundred and eighty-one thousand, seven hundred and fifty-fifth
Scientific notation3.681755 × 10^6
Engineering notation3.681755 × 10^6
In other bases
Ternary20221001102022base 3; the most digit-efficient integer base after e: 14 digits
Quinary1420304010base 5; one hand: 10 digits
Septenary43202660base 7: 8 digits
Nonary6831368base 9; each digit is two ternary digits: 7 digits
Duodecimal129678bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal13047fbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:2:42:35base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T100111T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000111001000101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000010110111011011
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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 2d db
Gray code1001000011101100110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000010110111011011
64-bit0000000000000000000000000000000000000000001110000010110111011011
One's complement11111111110001111101001000100100at 32 bits, every bit flipped
Bits reversed11011011101101000001110000000000at 32 bits
Rotated left by 100000000011100000101101110110110at 32 bits, wrapping
Shifted left by 111100000101101110110110= 7,363,510, no wrap
Shifted right by 1111000001011011101101= 1,840,877, discarding the low bit
These bits as a double1.81902866 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,681,755 to the power 213,555,319,880,025
3,681,755 to the power 349,907,366,744,881,443,875
3,681,755 to the power 4183,746,697,049,800,980,394,000,625
3,681,755 to the power 5676,510,320,596,590,008,570,513,771,096,875
First ten multiples3,681,755, 7,363,510, 11,045,265, 14,727,020, 18,408,775, 22,090,530, 25,772,285, 29,454,040, 33,135,795, 36,817,550
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 3
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 5
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 55
Collatz (3n + 1) trajectory
Steps to reach 1141the total stopping time
Highest value reached27,958,3367× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,681,755 → 11,045,266 → 5,522,633 → 16,567,900 → 8,283,950 → 4,141,975 → 12,425,926 → 6,212,963 → 18,638,890 → 9,319,445 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage368,175,500%
3,681,755% as a decimal36,817.55
3,681,755% of 1003,681,755
3,681,755% of 1,00036,817,550
As a fraction of 1003,681,755/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,681,755
Nerdulate something else
Nothing in mind? Surprise me · today’s page