Recognised as Number
2,377,801
- Positive
- Odd
- Prime
- 7 digits
2,377,801 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,377,801
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,377,801
Distinct prime factors12,377,801
Number of divisors2
Sum of divisors σ(n)2,377,802
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,377,800integers below n that share no factor with it
Carmichael function λ(n)2,377,800the 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, 2,377,8012 in total
Arithmetic
Previous number2,377,800
Next number2,377,802
Double4,755,602
Half1,188,900.5
Square5,653,937,595,601
Cube13,443,938,468,757,653,401
Square root1,542.011997359≈irrational, shown to 9 decimal places
Cube root133.472512307≈
Negation-2,377,801
Reciprocal4.2055664 × 10^-7≈
Representations
Decimal2,377,801
Binary100100010010000100100122 bits
Octal11044111
Hexadecimal244849
Base 361EYQ1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and seventy-seven thousand, eight hundred and one
Ordinaltwo million, three hundred and seventy-seven thousand, eight hundred and first
Scientific notation2.377801 × 10^6
Engineering notation2.377801 × 10^6
In other bases
Ternary11110210201201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1102042201base 5; one hand: 10 digits
Septenary26132236base 7: 8 digits
Nonary4423651base 9; each digit is two ternary digits: 7 digits
Duodecimal968061base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaleh4a1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:0:30:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11111T11T1TT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001000101100001011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001000100100001001001
Bit length22 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits15within that length
Bit parityodd7 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
Bytes324 48 49
Gray code1101100110110001101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001000100100001001001
64-bit0000000000000000000000000000000000000000001001000100100001001001
One's complement11111111110110111011011110110110at 32 bits, every bit flipped
Bits reversed10010010000100100010010000000000at 32 bits
Rotated left by 100000000010010001001000010010010at 32 bits, wrapping
Shifted left by 110010001001000010010010= 4,755,602, no wrap
Shifted right by 1100100010010000100100= 1,188,900, discarding the low bit
These bits as a double1.17478979 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,377,801 to the power 25,653,937,595,601
2,377,801 to the power 313,443,938,468,757,653,401
2,377,801 to the power 431,967,010,334,950,417,014,551,201
2,377,801 to the power 576,011,189,141,455,436,527,616,860,289,001
First ten multiples2,377,801, 4,755,602, 7,133,403, 9,511,204, 11,889,005, 14,266,806, 16,644,607, 19,022,408, 21,400,209, 23,778,010
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 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1236the total stopping time
Highest value reached146,422,38461× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,377,801 → 7,133,404 → 3,566,702 → 1,783,351 → 5,350,054 → 2,675,027 → 8,025,082 → 4,012,541 → 12,037,624 → 6,018,812 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage237,780,100%
2,377,801% as a decimal23,778.01
2,377,801% of 1002,377,801
2,377,801% of 1,00023,778,010
As a fraction of 1002,377,801/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 2,377,801
Nerdulate something else
Nothing in mind? Surprise me · today’s page