Recognised as Number
1,461,604
- Positive
- Even
- Composite
- 7 digits
1,461,604 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,461,604
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 × 23 × 15,887
Distinct prime factors32, 23, 15,887
Number of divisors12
Sum of divisors σ(n)2,669,184
Aliquot sum1,207,580sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)698,984integers below n that share no factor with it
Carmichael function λ(n)174,746the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 698,984
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 23, 46, 92, 15,887, 31,774, 63,548, 365,401, 730,802, 1,461,60412 in total
Arithmetic
Previous number1,461,603
Next number1,461,605
Double2,923,208
Half730,802
Square2,136,286,252,816
Cube3,122,404,532,260,876,864
Square root1,208.968155081≈irrational, shown to 9 decimal places
Cube root113.486248795≈
Negation-1,461,604
Reciprocal6.84179846 × 10^-7≈
Representations
Decimal1,461,604
Binary10110010011010110010021 bits
Octal5446544
Hexadecimal164D64
Base 36VBS4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and sixty-one thousand, six hundred and four
Ordinalone million, four hundred and sixty-one thousand, six hundred and fourth
Scientific notation1.461604 × 10^6
Engineering notation1.461604 × 10^6
In other bases
Ternary2202020221111base 3; the most digit-efficient integer base after e: 13 digits
Quinary333232404base 5; one hand: 9 digits
Septenary15265144base 7: 8 digits
Nonary2666844base 9; each digit is two ternary digits: 7 digits
Duodecimal5a5a04base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal92e04base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:46:0:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1T1T10T1111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010100101001010100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101100100110101100100
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; 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
Bytes316 4d 64
Gray code111010110101111010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101100100110101100100
64-bit0000000000000000000000000000000000000000000101100100110101100100
One's complement11111111111010011011001010011011at 32 bits, every bit flipped
Bits reversed00100110101100100110100000000000at 32 bits
Rotated left by 100000000001011001001101011001000at 32 bits, wrapping
Shifted left by 11011001001101011001000= 2,923,208, no wrap
Shifted right by 110110010011010110010= 730,802, discarding the low bit
These bits as a double7.22128324 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,461,604 to the power 22,136,286,252,816
1,461,604 to the power 33,122,404,532,260,876,864
1,461,604 to the power 44,563,718,953,970,626,667,929,856
1,461,604 to the power 56,670,349,877,999,283,820,352,949,249,024
First ten multiples1,461,604, 2,923,208, 4,384,812, 5,846,416, 7,308,020, 8,769,624, 10,231,228, 11,692,832, 13,154,436, 14,616,040
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 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 4
Divisible by 11No, remainder 1
Divisible by 12No, remainder 4
Divisible by 100No, remainder 4
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached1,461,604
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,461,604 → 730,802 → 365,401 → 1,096,204 → 548,102 → 274,051 → 822,154 → 411,077 → 1,233,232 → 616,616 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage146,160,400%
1,461,604% as a decimal14,616.04
1,461,604% of 1001,461,604
1,461,604% of 1,00014,616,040
As a fraction of 1001,461,604/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,461,604
Nerdulate something else
Nothing in mind? Surprise me · today’s page