Recognised as Number
1,774,463
- Positive
- Odd
- Prime
- 7 digits
1,774,463 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,774,463
Digit count7
Digit sum32
Digit product14,112
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,774,463
Distinct prime factors11,774,463
Number of divisors2
Sum of divisors σ(n)1,774,464
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,774,462integers below n that share no factor with it
Carmichael function λ(n)1,774,462the 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, 1,774,4632 in total
Arithmetic
Previous number1,774,462
Next number1,774,464
Double3,548,926
Half887,231.5
Square3,148,718,938,369
Cube5,587,285,253,535,070,847
Square root1,332.089711694≈irrational, shown to 9 decimal places
Cube root121.066034124≈
Negation-1,774,463
Reciprocal5.63550776 × 10^-7≈
Representations
Decimal1,774,463
Binary11011000100110111111121 bits
Octal6611577
Hexadecimal1B137F
Base 361216N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seven hundred and seventy-four thousand, four hundred and sixty-three
Ordinalone million, seven hundred and seventy-four thousand, four hundred and sixty-third
Scientific notation1.774463 × 10^6
Engineering notation1.774463 × 10^6
In other bases
Ternary10100011002212base 3; the most digit-efficient integer base after e: 14 digits
Quinary423240323base 5; one hand: 9 digits
Septenary21040235base 7: 8 digits
Nonary3304085base 9; each digit is two ternary digits: 7 digits
Duodecimal716a7bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalb1g33base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal8:12:54:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101000110100TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011110001010010000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110110001001101111111
Bit length21 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits7within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes31b 13 7f
Gray code101101001101011000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110110001001101111111
64-bit0000000000000000000000000000000000000000000110110001001101111111
One's complement11111111111001001110110010000000at 32 bits, every bit flipped
Bits reversed11111110110010001101100000000000at 32 bits
Rotated left by 100000000001101100010011011111110at 32 bits, wrapping
Shifted left by 11101100010011011111110= 3,548,926, no wrap
Shifted right by 111011000100110111111= 887,231, discarding the low bit
These bits as a double8.76701208 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,774,463 to the power 23,148,718,938,369
1,774,463 to the power 35,587,285,253,535,070,847
1,774,463 to the power 49,914,430,952,843,602,420,380,161
1,774,463 to the power 517,592,790,891,875,717,281,675,041,628,543
First ten multiples1,774,463, 3,548,926, 5,323,389, 7,097,852, 8,872,315, 10,646,778, 12,421,241, 14,195,704, 15,970,167, 17,744,630
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 11
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1220the total stopping time
Highest value reached60,636,76034× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,774,463 → 5,323,390 → 2,661,695 → 7,985,086 → 3,992,543 → 11,977,630 → 5,988,815 → 17,966,446 → 8,983,223 → 26,949,670 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage177,446,300%
1,774,463% as a decimal17,744.63
1,774,463% of 1001,774,463
1,774,463% of 1,00017,744,630
As a fraction of 1001,774,463/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,774,463
Nerdulate something else
Nothing in mind? Surprise me · today’s page