Recognised as Number
3,695,749
- Positive
- Odd
- Composite
- 7 digits
3,695,749 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,695,749
Digit count7
Digit sum43
Digit product204,120
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 factorisation17 × 217,397
Distinct prime factors217, 217,397
Number of divisors4
Sum of divisors σ(n)3,913,164
Aliquot sum217,415sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,478,336integers below n that share no factor with it
Carmichael function λ(n)869,584the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,478,336
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 17, 217,397, 3,695,7494 in total
Arithmetic
Previous number3,695,748
Next number3,695,750
Double7,391,498
Half1,847,874.5
Square13,658,560,671,001
Cube50,478,611,941,291,274,749
Square root1,922.433093764≈irrational, shown to 9 decimal places
Cube root154.608781≈
Negation-3,695,749
Reciprocal2.70581146 × 10^-7≈
Representations
Decimal3,695,749
Binary111000011001001000010122 bits
Octal16062205
Hexadecimal386485
Base 36277NP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and ninety-five thousand, seven hundred and forty-nine
Ordinalthree million, six hundred and ninety-five thousand, seven hundred and forty-ninth
Scientific notation3.695749 × 10^6
Engineering notation3.695749 × 10^6
In other bases
Ternary20221202121121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1421230444base 5; one hand: 10 digits
Septenary43261531base 7: 8 digits
Nonary6852547base 9; each digit is two ternary digits: 7 digits
Duodecimal12a28b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal131j79base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:6:35:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T100TT10T0TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010011010010110000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000110010010000101
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 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 64 85
Gray code1001000101011011000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000110010010000101
64-bit0000000000000000000000000000000000000000001110000110010010000101
One's complement11111111110001111001101101111010at 32 bits, every bit flipped
Bits reversed10100001001001100001110000000000at 32 bits
Rotated left by 100000000011100001100100100001010at 32 bits, wrapping
Shifted left by 111100001100100100001010= 7,391,498, no wrap
Shifted right by 1111000011001001000010= 1,847,874, discarding the low bit
These bits as a double1.82594262 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,695,749 to the power 213,658,560,671,001
3,695,749 to the power 350,478,611,941,291,274,749
3,695,749 to the power 4186,556,279,603,415,287,362,342,001
3,695,749 to the power 5689,465,183,788,042,444,854,088,087,853,749
First ten multiples3,695,749, 7,391,498, 11,087,247, 14,782,996, 18,478,745, 22,174,494, 25,870,243, 29,565,992, 33,261,741, 36,957,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 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 179the total stopping time
Highest value reached11,087,2483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,695,749 → 11,087,248 → 5,543,624 → 2,771,812 → 1,385,906 → 692,953 → 2,078,860 → 1,039,430 → 519,715 → 1,559,146 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage369,574,900%
3,695,749% as a decimal36,957.49
3,695,749% of 1003,695,749
3,695,749% of 1,00036,957,490
As a fraction of 1003,695,749/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,695,749
Nerdulate something else
Nothing in mind? Surprise me · today’s page