Recognised as Number
1,461,602
- Positive
- Even
- Composite
- 7 digits
1,461,602 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,461,602
Digit count7
Digit sum20
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 733 × 997
Distinct prime factors32, 733, 997
Number of divisors8
Sum of divisors σ(n)2,197,596
Aliquot sum735,994sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)729,072integers below n that share no factor with it
Carmichael function λ(n)60,756the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 729,072
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 733, 997, 1,466, 1,994, 730,801, 1,461,6028 in total
Arithmetic
Previous number1,461,601
Next number1,461,603
Double2,923,204
Half730,801
Square2,136,280,406,404
Cube3,122,391,714,560,899,208
Square root1,208.967327929≈irrational, shown to 9 decimal places
Cube root113.486197032≈
Negation-1,461,602
Reciprocal6.84180782 × 10^-7≈
Representations
Decimal1,461,602
Binary10110010011010110001021 bits
Octal5446542
Hexadecimal164D62
Base 36VBS2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and sixty-one thousand, six hundred and two
Ordinalone million, four hundred and sixty-one thousand, six hundred and second
Scientific notation1.461602 × 10^6
Engineering notation1.461602 × 10^6
In other bases
Ternary2202020221102base 3; the most digit-efficient integer base after e: 13 digits
Quinary333232402base 5; one hand: 9 digits
Septenary15265142base 7: 8 digits
Nonary2666842base 9; each digit is two ternary digits: 7 digits
Duodecimal5a5a02base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal92e02base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:46:0:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1T1T10T111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010100101001010100110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101100100110101100010
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 11 trailing zero
Power of twoNo
Bytes316 4d 62
Gray code111010110101111010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101100100110101100010
64-bit0000000000000000000000000000000000000000000101100100110101100010
One's complement11111111111010011011001010011101at 32 bits, every bit flipped
Bits reversed01000110101100100110100000000000at 32 bits
Rotated left by 100000000001011001001101011000100at 32 bits, wrapping
Shifted left by 11011001001101011000100= 2,923,204, no wrap
Shifted right by 110110010011010110001= 730,801, discarding the low bit
These bits as a double7.22127336 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,461,602 to the power 22,136,280,406,404
1,461,602 to the power 33,122,391,714,560,899,208
1,461,602 to the power 44,563,693,974,785,639,404,211,216
1,461,602 to the power 56,670,304,240,934,640,124,473,921,728,032
First ten multiples1,461,602, 2,923,204, 4,384,806, 5,846,408, 7,308,010, 8,769,612, 10,231,214, 11,692,816, 13,154,418, 14,616,020
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 2
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 2
Divisible by 100No, remainder 2
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached2,192,4041× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,461,602 → 730,801 → 2,192,404 → 1,096,202 → 548,101 → 1,644,304 → 822,152 → 411,076 → 205,538 → 102,769 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage146,160,200%
1,461,602% as a decimal14,616.02
1,461,602% of 1001,461,602
1,461,602% of 1,00014,616,020
As a fraction of 1001,461,602/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,602
Nerdulate something else
Nothing in mind? Surprise me · today’s page