Recognised as Number
2,377,799
- Positive
- Odd
- Prime
- 7 digits
2,377,799 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 value2,377,799
Digit count7
Digit sum44
Digit product166,698
Multiplicative persistence4times 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 factorisation2,377,799
Distinct prime factors12,377,799
Number of divisors2
Sum of divisors σ(n)2,377,800
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,377,798integers below n that share no factor with it
Carmichael function λ(n)2,377,798the 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,7992 in total
Arithmetic
Previous number2,377,798
Next number2,377,800
Double4,755,598
Half1,188,899.5
Square5,653,928,084,401
Cube13,443,904,545,160,613,399
Square root1,542.011348856≈irrational, shown to 9 decimal places
Cube root133.472474886≈
Negation-2,377,799
Reciprocal4.20556994 × 10^-7≈
Representations
Decimal2,377,799
Binary100100010010000100011122 bits
Octal11044107
Hexadecimal244847
Base 361EYPZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and seventy-seven thousand, seven hundred and ninety-nine
Ordinaltwo million, three hundred and seventy-seven thousand, seven hundred and ninety-ninth
Scientific notation2.377799 × 10^6
Engineering notation2.377799 × 10^6
In other bases
Ternary11110210201122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1102042144base 5; one hand: 10 digits
Septenary26132234base 7: 8 digits
Nonary4423648base 9; each digit is two ternary digits: 7 digits
Duodecimal96805bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaleh49jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:0:29:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11111T11T1TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001000101100001011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001000100100001000111
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
Bytes324 48 47
Gray code1101100110110001100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001000100100001000111
64-bit0000000000000000000000000000000000000000001001000100100001000111
One's complement11111111110110111011011110111000at 32 bits, every bit flipped
Bits reversed11100010000100100010010000000000at 32 bits
Rotated left by 100000000010010001001000010001110at 32 bits, wrapping
Shifted left by 110010001001000010001110= 4,755,598, no wrap
Shifted right by 1100100010010000100011= 1,188,899, discarding the low bit
These bits as a double1.1747888 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,377,799 to the power 25,653,928,084,401
2,377,799 to the power 313,443,904,545,160,613,399
2,377,799 to the power 431,966,902,783,578,361,379,528,801
2,377,799 to the power 576,010,869,471,889,844,109,882,203,488,999
First ten multiples2,377,799, 4,755,598, 7,133,397, 9,511,196, 11,888,995, 14,266,794, 16,644,593, 19,022,392, 21,400,191, 23,777,990
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 1122the total stopping time
Highest value reached19,281,9408× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,377,799 → 7,133,398 → 3,566,699 → 10,700,098 → 5,350,049 → 16,050,148 → 8,025,074 → 4,012,537 → 12,037,612 → 6,018,806 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage237,779,900%
2,377,799% as a decimal23,777.99
2,377,799% of 1002,377,799
2,377,799% of 1,00023,777,990
As a fraction of 1002,377,799/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,799
Nerdulate something else
Nothing in mind? Surprise me · today’s page