Recognised as Number
1,642,468
- Positive
- Even
- Composite
- 7 digits
1,642,468 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,642,468
Digit count7
Digit sum31
Digit product9,216
Multiplicative persistence3times 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^2 × 410,617
Distinct prime factors22, 410,617
Number of divisors6
Sum of divisors σ(n)2,874,326
Aliquot sum1,231,858sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)821,232integers below n that share no factor with it
Carmichael function λ(n)410,616the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 821,232
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 410,617, 821,234, 1,642,4686 in total
Arithmetic
Previous number1,642,467
Next number1,642,469
Double3,284,936
Half821,234
Square2,697,701,131,024
Cube4,430,887,781,270,727,232
Square root1,281.588077348≈irrational, shown to 9 decimal places
Cube root117.986496588≈
Negation-1,642,468
Reciprocal6.08839868 × 10^-7≈
Representations
Decimal1,642,468
Binary11001000011111110010021 bits
Octal6207744
Hexadecimal190FE4
Base 36Z7C4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and forty-two thousand, four hundred and sixty-eight
Ordinalone million, six hundred and forty-two thousand, four hundred and sixty-eighth
Scientific notation1.642468 × 10^6
Engineering notation1.642468 × 10^6
In other bases
Ternary10002110001011base 3; the most digit-efficient integer base after e: 14 digits
Quinary410024333base 5; one hand: 9 digits
Septenary16650352base 7: 8 digits
Nonary3073034base 9; each digit is two ternary digits: 7 digits
Duodecimal672604base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala5638base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:36:14:28base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1001T110001011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010010001000000100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110010000111111100100
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes319 0f e4
Gray code101011000100000010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110010000111111100100
64-bit0000000000000000000000000000000000000000000110010000111111100100
One's complement11111111111001101111000000011011at 32 bits, every bit flipped
Bits reversed00100111111100001001100000000000at 32 bits
Rotated left by 100000000001100100001111111001000at 32 bits, wrapping
Shifted left by 11100100001111111001000= 3,284,936, no wrap
Shifted right by 111001000011111110010= 821,234, discarding the low bit
These bits as a double8.11487013 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,642,468 to the power 22,697,701,131,024
1,642,468 to the power 34,430,887,781,270,727,232
1,642,468 to the power 47,277,591,392,328,168,815,288,576
1,642,468 to the power 511,953,210,978,974,462,777,709,396,845,568
First ten multiples1,642,468, 3,284,936, 4,927,404, 6,569,872, 8,212,340, 9,854,808, 11,497,276, 13,139,744, 14,782,212, 16,424,680
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 8
Divisible by 11No, remainder 3
Divisible by 12No, remainder 4
Divisible by 100No, remainder 68
Collatz (3n + 1) trajectory
Steps to reach 1194the total stopping time
Highest value reached2,630,9321× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,642,468 → 821,234 → 410,617 → 1,231,852 → 615,926 → 307,963 → 923,890 → 461,945 → 1,385,836 → 692,918 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage164,246,800%
1,642,468% as a decimal16,424.68
1,642,468% of 1001,642,468
1,642,468% of 1,00016,424,680
As a fraction of 1001,642,468/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 1,642,468
Nerdulate something else
Nothing in mind? Surprise me · today’s page