Recognised as Number
3,703,681
- Positive
- Odd
- Composite
- 7 digits
3,703,681 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,703,681
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation191 × 19,391
Distinct prime factors2191, 19,391
Number of divisors4
Sum of divisors σ(n)3,723,264
Aliquot sum19,583sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,684,100integers below n that share no factor with it
Carmichael function λ(n)368,410the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,684,100
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 191, 19,391, 3,703,6814 in total
Arithmetic
Previous number3,703,680
Next number3,703,682
Double7,407,362
Half1,851,840.5
Square13,717,252,949,761
Cube50,804,329,122,223,770,241
Square root1,924.494998694≈irrational, shown to 9 decimal places
Cube root154.719311643≈
Negation-3,703,681
Reciprocal2.70001655 × 10^-7≈
Representations
Decimal3,703,681
Binary111000100000111000000122 bits
Octal16101601
Hexadecimal388381
Base 3627DS1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and three thousand, six hundred and eighty-one
Ordinalthree million, seven hundred and three thousand, six hundred and eighty-first
Scientific notation3.703681 × 10^6
Engineering notation3.703681 × 10^6
In other bases
Ternary20222011111101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1422004211base 5; one hand: 10 digits
Septenary43323622base 7: 8 digits
Nonary6864441base 9; each digit is two ternary digits: 7 digits
Duodecimal12a7401base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal132j41base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:8:48:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T100T011111101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010011000010010000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110001000001110000001
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 set bits, so even; 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 83 81
Gray code1001001100001001000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110001000001110000001
64-bit0000000000000000000000000000000000000000001110001000001110000001
One's complement11111111110001110111110001111110at 32 bits, every bit flipped
Bits reversed10000001110000010001110000000000at 32 bits
Rotated left by 100000000011100010000011100000010at 32 bits, wrapping
Shifted left by 111100010000011100000010= 7,407,362, no wrap
Shifted right by 1111000100000111000000= 1,851,840, discarding the low bit
These bits as a double1.82986155 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,703,681 to the power 213,717,252,949,761
3,703,681 to the power 350,804,329,122,223,770,241
3,703,681 to the power 4188,163,028,487,726,855,589,957,121
3,703,681 to the power 5696,895,833,512,452,688,238,267,979,862,401
First ten multiples3,703,681, 7,407,362, 11,111,043, 14,814,724, 18,518,405, 22,222,086, 25,925,767, 29,629,448, 33,333,129, 37,036,810
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 1141the total stopping time
Highest value reached11,111,0443× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,703,681 → 11,111,044 → 5,555,522 → 2,777,761 → 8,333,284 → 4,166,642 → 2,083,321 → 6,249,964 → 3,124,982 → 1,562,491 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage370,368,100%
3,703,681% as a decimal37,036.81
3,703,681% of 1003,703,681
3,703,681% of 1,00037,036,810
As a fraction of 1003,703,681/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,703,681
Nerdulate something else
Nothing in mind? Surprise me · today’s page