Recognised as Number
3,687,043
- Positive
- Odd
- Prime
- 7 digits
3,687,043 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,687,043
Digit count7
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,687,043
Distinct prime factors13,687,043
Number of divisors2
Sum of divisors σ(n)3,687,044
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,687,042integers below n that share no factor with it
Carmichael function λ(n)3,687,042the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3,687,0432 in total
Arithmetic
Previous number3,687,042
Next number3,687,044
Double7,374,086
Half1,843,521.5
Square13,594,286,083,849
Cube50,122,717,345,452,868,507
Square root1,920.167440616≈irrational, shown to 9 decimal places
Cube root154.487282636≈
Negation-3,687,043
Reciprocal2.71220054 × 10^-7≈
Representations
Decimal3,687,043
Binary111000010000101000001122 bits
Octal16041203
Hexadecimal384283
Base 36270XV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and eighty-seven thousand and forty-three
Ordinalthree million, six hundred and eighty-seven thousand and forty-third
Scientific notation3.687043 × 10^6
Engineering notation3.687043 × 10^6
In other bases
Ternary20221022200011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1420441133base 5; one hand: 10 digits
Septenary43224253base 7: 8 digits
Nonary6838604base 9; each digit is two ternary digits: 7 digits
Duodecimal1299857base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal130hc3base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:4:10:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T1100T00011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000100011110000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000100001010000011
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 42 83
Gray code1001000110001111000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000100001010000011
64-bit0000000000000000000000000000000000000000001110000100001010000011
One's complement11111111110001111011110101111100at 32 bits, every bit flipped
Bits reversed11000001010000100001110000000000at 32 bits
Rotated left by 100000000011100001000010100000110at 32 bits, wrapping
Shifted left by 111100001000010100000110= 7,374,086, no wrap
Shifted right by 1111000010000101000001= 1,843,521, discarding the low bit
These bits as a double1.82164128 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,687,043 to the power 213,594,286,083,849
3,687,043 to the power 350,122,717,345,452,868,507
3,687,043 to the power 4184,804,614,129,530,580,658,654,801
3,687,043 to the power 5681,382,558,893,986,820,703,428,573,443,443
First ten multiples3,687,043, 7,374,086, 11,061,129, 14,748,172, 18,435,215, 22,122,258, 25,809,301, 29,496,344, 33,183,387, 36,870,430
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1141the total stopping time
Highest value reached16,591,6964× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,687,043 → 11,061,130 → 5,530,565 → 16,591,696 → 8,295,848 → 4,147,924 → 2,073,962 → 1,036,981 → 3,110,944 → 1,555,472 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage368,704,300%
3,687,043% as a decimal36,870.43
3,687,043% of 1003,687,043
3,687,043% of 1,00036,870,430
As a fraction of 1003,687,043/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,687,043
Nerdulate something else
Nothing in mind? Surprise me · today’s page