Recognised as Number
3,977,153
- Positive
- Odd
- Prime
- 7 digits
3,977,153 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,977,153
Digit count7
Digit sum35
Digit product19,845
Multiplicative persistence3times 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,977,153
Distinct prime factors13,977,153
Number of divisors2
Sum of divisors σ(n)3,977,154
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,977,152integers below n that share no factor with it
Carmichael function λ(n)3,977,152the 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,977,1532 in total
Arithmetic
Previous number3,977,152
Next number3,977,154
Double7,954,306
Half1,988,576.5
Square15,817,745,985,409
Cube62,909,595,899,107,360,577
Square root1,994.280070602≈irrational, shown to 9 decimal places
Cube root158.437300015≈
Negation-3,977,153
Reciprocal2.5143614 × 10^-7≈
Representations
Decimal3,977,153
Binary111100101011111100000122 bits
Octal17127701
Hexadecimal3CAFC1
Base 362D8SH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and seventy-seven thousand, one hundred and fifty-three
Ordinalthree million, nine hundred and seventy-seven thousand, one hundred and fifty-third
Scientific notation3.977153 × 10^6
Engineering notation3.977153 × 10^6
In other bases
Ternary21111001121222base 3; the most digit-efficient integer base after e: 14 digits
Quinary2004232103base 5; one hand: 10 digits
Septenary45543125base 7: 8 digits
Nonary7431558base 9; each digit is two ternary digits: 7 digits
Duodecimal13b9715base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14h2hdbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:24:45:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T111101TT0T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011011111000011000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111001010111111000001
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
Bytes33c af c1
Gray code1000101111100000100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111001010111111000001
64-bit0000000000000000000000000000000000000000001111001010111111000001
One's complement11111111110000110101000000111110at 32 bits, every bit flipped
Bits reversed10000011111101010011110000000000at 32 bits
Rotated left by 100000000011110010101111110000010at 32 bits, wrapping
Shifted left by 111110010101111110000010= 7,954,306, no wrap
Shifted right by 1111100101011111100000= 1,988,576, discarding the low bit
These bits as a double1.96497467 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,977,153 to the power 215,817,745,985,409
3,977,153 to the power 362,909,595,899,107,360,577
3,977,153 to the power 4250,201,088,058,922,536,440,897,281
3,977,153 to the power 5995,088,007,976,807,942,573,523,943,820,993
First ten multiples3,977,153, 7,954,306, 11,931,459, 15,908,612, 19,885,765, 23,862,918, 27,840,071, 31,817,224, 35,794,377, 39,771,530
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 53
Collatz (3n + 1) trajectory
Steps to reach 1216the total stopping time
Highest value reached11,931,4603× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,977,153 → 11,931,460 → 5,965,730 → 2,982,865 → 8,948,596 → 4,474,298 → 2,237,149 → 6,711,448 → 3,355,724 → 1,677,862 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage397,715,300%
3,977,153% as a decimal39,771.53
3,977,153% of 1003,977,153
3,977,153% of 1,00039,771,530
As a fraction of 1003,977,153/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,977,153
Nerdulate something else
Nothing in mind? Surprise me · today’s page