Recognised as Number
2,446,879
- Positive
- Odd
- Prime
- 7 digits
2,446,879 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,446,879
Digit count7
Digit sum40
Digit product96,768
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,446,879
Distinct prime factors12,446,879
Number of divisors2
Sum of divisors σ(n)2,446,880
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,446,878integers below n that share no factor with it
Carmichael function λ(n)2,446,878the 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,446,8792 in total
Arithmetic
Previous number2,446,878
Next number2,446,880
Double4,893,758
Half1,223,439.5
Square5,987,216,840,641
Cube14,649,995,155,810,809,439
Square root1,564.250299664≈irrational, shown to 9 decimal places
Cube root134.752706864≈
Negation-2,446,879
Reciprocal4.08683879 × 10^-7≈
Representations
Decimal2,446,879
Binary100101010101100001111122 bits
Octal11253037
Hexadecimal25561F
Base 361GG0V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and forty-six thousand, eight hundred and seventy-nine
Ordinaltwo million, four hundred and forty-six thousand, eight hundred and seventy-ninth
Scientific notation2.446879 × 10^6
Engineering notation2.446879 × 10^6
In other bases
Ternary11121022111011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1111300004base 5; one hand: 10 digits
Septenary26540521base 7: 8 digits
Nonary4538434base 9; each digit is two ternary digits: 7 digits
Duodecimal9a0027base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalf5h3jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:19:41:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTT110T111011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110101010101001100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001010101011000011111
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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
Bytes325 56 1f
Gray code1101111111110100010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001010101011000011111
64-bit0000000000000000000000000000000000000000001001010101011000011111
One's complement11111111110110101010100111100000at 32 bits, every bit flipped
Bits reversed11111000011010101010010000000000at 32 bits
Rotated left by 100000000010010101010110000111110at 32 bits, wrapping
Shifted left by 110010101010110000111110= 4,893,758, no wrap
Shifted right by 1100101010101100001111= 1,223,439, discarding the low bit
These bits as a double1.20891885 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,446,879 to the power 25,987,216,840,641
2,446,879 to the power 314,649,995,155,810,809,439
2,446,879 to the power 435,846,765,496,855,197,589,290,881
2,446,879 to the power 587,712,697,712,179,549,022,086,481,610,399
First ten multiples2,446,879, 4,893,758, 7,340,637, 9,787,516, 12,234,395, 14,681,274, 17,128,153, 19,575,032, 22,021,911, 24,468,790
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1161the total stopping time
Highest value reached37,161,98815× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,446,879 → 7,340,638 → 3,670,319 → 11,010,958 → 5,505,479 → 16,516,438 → 8,258,219 → 24,774,658 → 12,387,329 → 37,161,988 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage244,687,900%
2,446,879% as a decimal24,468.79
2,446,879% of 1002,446,879
2,446,879% of 1,00024,468,790
As a fraction of 1002,446,879/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,446,879
Nerdulate something else
Nothing in mind? Surprise me · today’s page