Recognised as Number
1,585,464
- Positive
- Even
- Composite
- 7 digits
1,585,464 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,585,464
Digit count7
Digit sum33
Digit product19,200
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 3 × 31 × 2,131
Distinct prime factors42, 3, 31, 2,131
Number of divisors32
Sum of divisors σ(n)4,093,440
Aliquot sum2,507,976sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)511,200integers below n that share no factor with it
Carmichael function λ(n)2,130the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 511,200
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 12, 24, 31, 62, 93, 124, 186, 248, 372, 744, 2,131, 4,262, 6,393, 8,524, 12,786, 17,048, 25,572, 51,144, 66,061, 132,122, 198,183, 264,244, 396,366, 528,488, 792,732, 1,585,46432 in total
Arithmetic
Previous number1,585,463
Next number1,585,465
Double3,170,928
Half792,732
Square2,513,696,095,296
Cube3,985,374,666,032,377,344
Square root1,259.152095658≈irrational, shown to 9 decimal places
Cube root116.605435443≈
Negation-1,585,464
Reciprocal6.30730184 × 10^-7≈
Representations
Decimal1,585,464
Binary11000001100010011100021 bits
Octal6030470
Hexadecimal183138
Base 36XZCO
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and eighty-five thousand, four hundred and sixty-four
Ordinalone million, five hundred and eighty-five thousand, four hundred and sixty-fourth
Scientific notation1.585464 × 10^6
Engineering notation1.585464 × 10^6
In other bases
Ternary2222112211220base 3; the most digit-efficient integer base after e: 13 digits
Quinary401213324base 5; one hand: 9 digits
Septenary16322226base 7: 8 digits
Nonary2875756base 9; each digit is two ternary digits: 7 digits
Duodecimal645620base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9i3d4base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:20:24:24base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10000TT00TT0T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010000111000101001000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110000011000100111000
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes318 31 38
Gray code101000010100110100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110000011000100111000
64-bit0000000000000000000000000000000000000000000110000011000100111000
One's complement11111111111001111100111011000111at 32 bits, every bit flipped
Bits reversed00011100100011000001100000000000at 32 bits
Rotated left by 100000000001100000110001001110000at 32 bits, wrapping
Shifted left by 11100000110001001110000= 3,170,928, no wrap
Shifted right by 111000001100010011100= 792,732, discarding the low bit
These bits as a double7.83323295 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,585,464 to the power 22,513,696,095,296
1,585,464 to the power 33,985,374,666,032,377,344
1,585,464 to the power 46,318,668,059,506,357,113,327,616
1,585,464 to the power 510,018,020,736,297,186,974,324,855,373,824
First ten multiples1,585,464, 3,170,928, 4,756,392, 6,341,856, 7,927,320, 9,512,784, 11,098,248, 12,683,712, 14,269,176, 15,854,640
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 6
Divisible by 10No, remainder 4
Divisible by 11No, remainder 1
Divisible by 12Yes
Divisible by 100No, remainder 64
Collatz (3n + 1) trajectory
Steps to reach 175the total stopping time
Highest value reached1,585,464
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,585,464 → 792,732 → 396,366 → 198,183 → 594,550 → 297,275 → 891,826 → 445,913 → 1,337,740 → 668,870 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage158,546,400%
1,585,464% as a decimal15,854.64
1,585,464% of 1001,585,464
1,585,464% of 1,00015,854,640
As a fraction of 1001,585,464/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,585,464
Nerdulate something else
Nothing in mind? Surprise me · today’s page