Recognised as Number
3,756,887
- Positive
- Odd
- Prime
- 7 digits
3,756,887 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,756,887
Digit count7
Digit sum44
Digit product282,240
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,756,887
Distinct prime factors13,756,887
Number of divisors2
Sum of divisors σ(n)3,756,888
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,756,886integers below n that share no factor with it
Carmichael function λ(n)3,756,886the 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,756,8872 in total
Arithmetic
Previous number3,756,886
Next number3,756,888
Double7,513,774
Half1,878,443.5
Square14,114,199,930,769
Cube53,025,454,235,306,956,103
Square root1,938.269073168≈irrational, shown to 9 decimal places
Cube root155.456676068≈
Negation-3,756,887
Reciprocal2.66177822 × 10^-7≈
Representations
Decimal3,756,887
Binary111001010100110101011122 bits
Octal16251527
Hexadecimal395357
Base 3628ITZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and fifty-six thousand, eight hundred and eighty-seven
Ordinalthree million, seven hundred and fifty-six thousand, eight hundred and eighty-seventh
Scientific notation3.756887 × 10^6
Engineering notation3.756887 × 10^6
In other bases
Ternary21001212110222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1430210022base 5; one hand: 10 digits
Septenary43635011base 7: 8 digits
Nonary7055428base 9; each digit is two ternary digits: 7 digits
Duodecimal131215bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal139c47base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:23:34:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T101T0TT11100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010010101010010101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110010101001101010111
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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
Bytes339 53 57
Gray code1001011111101011111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110010101001101010111
64-bit0000000000000000000000000000000000000000001110010101001101010111
One's complement11111111110001101010110010101000at 32 bits, every bit flipped
Bits reversed11101010110010101001110000000000at 32 bits
Rotated left by 100000000011100101010011010101110at 32 bits, wrapping
Shifted left by 111100101010011010101110= 7,513,774, no wrap
Shifted right by 1111001010100110101011= 1,878,443, discarding the low bit
These bits as a double1.8561488 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,756,887 to the power 214,114,199,930,769
3,756,887 to the power 353,025,454,235,306,956,103
3,756,887 to the power 4199,210,639,685,719,644,392,931,361
3,756,887 to the power 5748,411,862,496,964,217,664,426,722,033,207
First ten multiples3,756,887, 7,513,774, 11,270,661, 15,027,548, 18,784,435, 22,541,322, 26,298,209, 30,055,096, 33,811,983, 37,568,870
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1185the total stopping time
Highest value reached25,358,9926× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,756,887 → 11,270,662 → 5,635,331 → 16,905,994 → 8,452,997 → 25,358,992 → 12,679,496 → 6,339,748 → 3,169,874 → 1,584,937 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage375,688,700%
3,756,887% as a decimal37,568.87
3,756,887% of 1003,756,887
3,756,887% of 1,00037,568,870
As a fraction of 1003,756,887/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,756,887
Nerdulate something else
Nothing in mind? Surprise me · today’s page