Recognised as Number
3,775,797
- Positive
- Odd
- Composite
- 7 digits
3,775,797 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,775,797
Digit count7
Digit sum45
Digit product324,135
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 281 × 1,493
Distinct prime factors33, 281, 1,493
Number of divisors12
Sum of divisors σ(n)5,477,004
Aliquot sum1,701,207sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,506,560integers below n that share no factor with it
Carmichael function λ(n)313,320the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,506,560
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 281, 843, 1,493, 2,529, 4,479, 13,437, 419,533, 1,258,599, 3,775,79712 in total
Arithmetic
Previous number3,775,796
Next number3,775,798
Double7,551,594
Half1,887,898.5
Square14,256,642,985,209
Cube53,830,189,813,623,186,573
Square root1,943.141013926≈irrational, shown to 9 decimal places
Cube root155.717066054≈
Negation-3,775,797
Reciprocal2.64844747 × 10^-7≈
Representations
Decimal3,775,797
Binary111001100111010011010122 bits
Octal16316465
Hexadecimal399D35
Base 3628XF9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and seventy-five thousand, seven hundred and ninety-seven
Ordinalthree million, seven hundred and seventy-five thousand, seven hundred and ninety-seventh
Scientific notation3.775797 × 10^6
Engineering notation3.775797 × 10^6
In other bases
Ternary21002211102100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1431311142base 5; one hand: 10 digits
Septenary44044104base 7: 8 digits
Nonary7084370base 9; each digit is two ternary digits: 7 digits
Duodecimal1321099base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal13bj9hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:28:49:57base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1010T1111T100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011101110110101110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110011001110100110101
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 9d 35
Gray code1001010101001110101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110011001110100110101
64-bit0000000000000000000000000000000000000000001110011001110100110101
One's complement11111111110001100110001011001010at 32 bits, every bit flipped
Bits reversed10101100101110011001110000000000at 32 bits
Rotated left by 100000000011100110011101001101010at 32 bits, wrapping
Shifted left by 111100110011101001101010= 7,551,594, no wrap
Shifted right by 1111001100111010011010= 1,887,898, discarding the low bit
These bits as a double1.86549158 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,775,797 to the power 214,256,642,985,209
3,775,797 to the power 353,830,189,813,623,186,573
3,775,797 to the power 4203,251,869,207,708,986,992,773,681
3,775,797 to the power 5767,437,797,998,859,969,960,353,886,398,757
First ten multiples3,775,797, 7,551,594, 11,327,391, 15,103,188, 18,878,985, 22,654,782, 26,430,579, 30,206,376, 33,982,173, 37,757,970
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 97
Collatz (3n + 1) trajectory
Steps to reach 1154the total stopping time
Highest value reached11,327,3923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,775,797 → 11,327,392 → 5,663,696 → 2,831,848 → 1,415,924 → 707,962 → 353,981 → 1,061,944 → 530,972 → 265,486 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage377,579,700%
3,775,797% as a decimal37,757.97
3,775,797% of 1003,775,797
3,775,797% of 1,00037,757,970
As a fraction of 1003,775,797/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,775,797
Nerdulate something else
Nothing in mind? Surprise me · today’s page