Recognised as Number
3,695,716
- Positive
- Even
- Composite
- 7 digits
3,695,716 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,695,716
Digit count7
Digit sum37
Digit product34,020
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 923,929
Distinct prime factors22, 923,929
Number of divisors6
Sum of divisors σ(n)6,467,510
Aliquot sum2,771,794sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,847,856integers below n that share no factor with it
Carmichael function λ(n)923,928the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,847,856
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 923,929, 1,847,858, 3,695,7166 in total
Arithmetic
Previous number3,695,715
Next number3,695,717
Double7,391,432
Half1,847,858
Square13,658,316,752,656
Cube50,477,259,755,858,821,696
Square root1,922.424510872≈irrational, shown to 9 decimal places
Cube root154.608320822≈
Negation-3,695,716
Reciprocal2.70583562 × 10^-7≈
Representations
Decimal3,695,716
Binary111000011001000110010022 bits
Octal16062144
Hexadecimal386464
Base 36277MS
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and ninety-five thousand, seven hundred and sixteen
Ordinalthree million, six hundred and ninety-five thousand, seven hundred and sixteenth
Scientific notation3.695716 × 10^6
Engineering notation3.695716 × 10^6
In other bases
Ternary20221202120101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1421230331base 5; one hand: 10 digits
Septenary43261453base 7: 8 digits
Nonary6852511base 9; each digit is two ternary digits: 7 digits
Duodecimal12a2884base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal131j5gbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:6:35:16base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T100TT10TT0101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010011010010110100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000110010001100100
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes338 64 64
Gray code1001000101011001010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000110010001100100
64-bit0000000000000000000000000000000000000000001110000110010001100100
One's complement11111111110001111001101110011011at 32 bits, every bit flipped
Bits reversed00100110001001100001110000000000at 32 bits
Rotated left by 100000000011100001100100011001000at 32 bits, wrapping
Shifted left by 111100001100100011001000= 7,391,432, no wrap
Shifted right by 1111000011001000110010= 1,847,858, discarding the low bit
These bits as a double1.82592631 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,695,716 to the power 213,658,316,752,656
3,695,716 to the power 350,477,259,755,858,821,696
3,695,716 to the power 4186,549,616,515,883,541,083,054,336
3,695,716 to the power 5689,434,402,551,615,056,917,301,238,424,576
First ten multiples3,695,716, 7,391,432, 11,087,148, 14,782,864, 18,478,580, 22,174,296, 25,870,012, 29,565,728, 33,261,444, 36,957,160
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 4
Divisible by 9No, remainder 1
Divisible by 10No, remainder 6
Divisible by 11No, remainder 2
Divisible by 12No, remainder 4
Divisible by 100No, remainder 16
Collatz (3n + 1) trajectory
Steps to reach 179the total stopping time
Highest value reached3,695,716
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,695,716 → 1,847,858 → 923,929 → 2,771,788 → 1,385,894 → 692,947 → 2,078,842 → 1,039,421 → 3,118,264 → 1,559,132 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage369,571,600%
3,695,716% as a decimal36,957.16
3,695,716% of 1003,695,716
3,695,716% of 1,00036,957,160
As a fraction of 1003,695,716/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,716
Nerdulate something else
Nothing in mind? Surprise me · today’s page