Recognised as Number
3,689,751
- Positive
- Odd
- Composite
- 7 digits
3,689,751 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,689,751
Digit count7
Digit sum39
Digit product45,360
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 13 × 37 × 2,557
Distinct prime factors43, 13, 37, 2,557
Number of divisors16
Sum of divisors σ(n)5,443,424
Aliquot sum1,753,673sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,208,384integers below n that share no factor with it
Carmichael function λ(n)2,556the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,208,384
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 13, 37, 39, 111, 481, 1,443, 2,557, 7,671, 33,241, 94,609, 99,723, 283,827, 1,229,917, 3,689,75116 in total
Arithmetic
Previous number3,689,750
Next number3,689,752
Double7,379,502
Half1,844,875.5
Square13,614,262,442,001
Cube50,233,238,459,635,631,751
Square root1,920.872458025≈irrational, shown to 9 decimal places
Cube root154.525095158≈
Negation-3,689,751
Reciprocal2.71020998 × 10^-7≈
Representations
Decimal3,689,751
Binary111000010011010001011122 bits
Octal16046427
Hexadecimal384D17
Base 3627313
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and eighty-nine thousand, seven hundred and fifty-one
Ordinalthree million, six hundred and eighty-nine thousand, seven hundred and fifty-first
Scientific notation3.689751 × 10^6
Engineering notation3.689751 × 10^6
In other bases
Ternary20221110101110base 3; the most digit-efficient integer base after e: 14 digits
Quinary1421033001base 5; one hand: 10 digits
Septenary43235202base 7: 8 digits
Nonary6843343base 9; each digit is two ternary digits: 7 digits
Duodecimal129b333base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal13147bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:4:55:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T1110101110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000101110101101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000100110100010111
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 4d 17
Gray code1001000110101110011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000100110100010111
64-bit0000000000000000000000000000000000000000001110000100110100010111
One's complement11111111110001111011001011101000at 32 bits, every bit flipped
Bits reversed11101000101100100001110000000000at 32 bits
Rotated left by 100000000011100001001101000101110at 32 bits, wrapping
Shifted left by 111100001001101000101110= 7,379,502, no wrap
Shifted right by 1111000010011010001011= 1,844,875, discarding the low bit
These bits as a double1.82297921 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,689,751 to the power 213,614,262,442,001
3,689,751 to the power 350,233,238,459,635,631,751
3,689,751 to the power 4185,348,141,839,679,031,888,884,001
3,689,751 to the power 5683,888,491,701,097,547,591,041,631,573,751
First ten multiples3,689,751, 7,379,502, 11,069,253, 14,759,004, 18,448,755, 22,138,506, 25,828,257, 29,518,008, 33,207,759, 36,897,510
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 51
Collatz (3n + 1) trajectory
Steps to reach 1203the total stopping time
Highest value reached24,905,8246× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,689,751 → 11,069,254 → 5,534,627 → 16,603,882 → 8,301,941 → 24,905,824 → 12,452,912 → 6,226,456 → 3,113,228 → 1,556,614 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage368,975,100%
3,689,751% as a decimal36,897.51
3,689,751% of 1003,689,751
3,689,751% of 1,00036,897,510
As a fraction of 1003,689,751/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,689,751
Nerdulate something else
Nothing in mind? Surprise me · today’s page