Recognised as Number
2,468,720
- Positive
- Even
- Composite
- 7 digits
2,468,720 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,468,720
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 5 × 30,859
Distinct prime factors32, 5, 30,859
Number of divisors20
Sum of divisors σ(n)5,739,960
Aliquot sum3,271,240sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)987,456integers below n that share no factor with it
Carmichael function λ(n)61,716the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 987,456
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 30,859, 61,718, 123,436, 154,295, 246,872, 308,590, 493,744, 617,180, 1,234,360, 2,468,72020 in total
Arithmetic
Previous number2,468,719
Next number2,468,721
Double4,937,440
Half1,234,360
Square6,094,578,438,400
Cube15,045,807,682,446,848,000
Square root1,571.216089531≈irrational, shown to 9 decimal places
Cube root135.152456936≈
Negation-2,468,720
Reciprocal4.05068213 × 10^-7≈
Representations
Decimal2,468,720
Binary100101101010110111000022 bits
Octal11325560
Hexadecimal25AB70
Base 361GWVK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and sixty-eight thousand, seven hundred and twenty
Ordinaltwo million, four hundred and sixty-eight thousand, seven hundred and twentieth
Scientific notation2.46872 × 10^6
Engineering notation2.46872 × 10^6
In other bases
Ternary11122102110002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1112444340base 5; one hand: 10 digits
Septenary26661302base 7: 8 digits
Nonary4572402base 9; each digit is two ternary digits: 7 digits
Duodecimal9b07a8base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalf8bg0base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:25:45:20base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT0T11T11001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110101111110010110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001011010101101110000
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes325 ab 70
Gray code1101110111111011001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001011010101101110000
64-bit0000000000000000000000000000000000000000001001011010101101110000
One's complement11111111110110100101010010001111at 32 bits, every bit flipped
Bits reversed00001110110101011010010000000000at 32 bits
Rotated left by 100000000010010110101011011100000at 32 bits, wrapping
Shifted left by 110010110101011011100000= 4,937,440, no wrap
Shifted right by 1100101101010110111000= 1,234,360, discarding the low bit
These bits as a double1.21970974 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,468,720 to the power 26,094,578,438,400
2,468,720 to the power 315,045,807,682,446,848,000
2,468,720 to the power 437,143,886,341,810,182,594,560,000
2,468,720 to the power 591,697,855,089,753,633,974,842,163,200,000
First ten multiples2,468,720, 4,937,440, 7,406,160, 9,874,880, 12,343,600, 14,812,320, 17,281,040, 19,749,760, 22,218,480, 24,687,200
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11No, remainder 1
Divisible by 12No, remainder 8
Divisible by 100No, remainder 20
Collatz (3n + 1) trajectory
Steps to reach 181the total stopping time
Highest value reached2,468,720
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,468,720 → 1,234,360 → 617,180 → 308,590 → 154,295 → 462,886 → 231,443 → 694,330 → 347,165 → 1,041,496 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage246,872,000%
2,468,720% as a decimal24,687.2
2,468,720% of 1002,468,720
2,468,720% of 1,00024,687,200
As a fraction of 1002,468,720/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,468,720
Nerdulate something else
Nothing in mind? Surprise me · today’s page