Recognised as Number
1,615,128
- Positive
- Even
- Composite
- 7 digits
1,615,128 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,615,128
Digit count7
Digit sum24
Digit product480
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 numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 3 × 173 × 389
Distinct prime factors42, 3, 173, 389
Number of divisors32
Sum of divisors σ(n)4,071,600
Aliquot sum2,456,472sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)533,888integers below n that share no factor with it
Carmichael function λ(n)16,684the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 533,888
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, 173, 346, 389, 519, 692, 778, 1,038, 1,167, 1,384, 1,556, 2,076, 2,334, 3,112, 4,152, 4,668, 9,336, 67,297, 134,594, 201,891, 269,188, 403,782, 538,376, 807,564, 1,615,12832 in total
Arithmetic
Previous number1,615,127
Next number1,615,129
Double3,230,256
Half807,564
Square2,608,638,456,384
Cube4,213,285,012,782,577,152
Square root1,270.876862642≈irrational, shown to 9 decimal places
Cube root117.328174991≈
Negation-1,615,128
Reciprocal6.19145975 × 10^-7≈
Representations
Decimal1,615,128
Binary11000101001010001100021 bits
Octal6122430
Hexadecimal18A518
Base 36YM8O
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and fifteen thousand, one hundred and twenty-eight
Ordinalone million, six hundred and fifteen thousand, one hundred and twenty-eighth
Scientific notation1.615128 × 10^6
Engineering notation1.615128 × 10^6
In other bases
Ternary10001001112120base 3; the most digit-efficient integer base after e: 14 digits
Quinary403141003base 5; one hand: 9 digits
Septenary16504554base 7: 8 digits
Nonary3031476base 9; each digit is two ternary digits: 7 digits
Duodecimal65a820base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala1hg8base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:28:38:48base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1000101TTT0TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011110010101101000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110001010010100011000
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 a5 18
Gray code101001111011110010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110001010010100011000
64-bit0000000000000000000000000000000000000000000110001010010100011000
One's complement11111111111001110101101011100111at 32 bits, every bit flipped
Bits reversed00011000101001010001100000000000at 32 bits
Rotated left by 100000000001100010100101000110000at 32 bits, wrapping
Shifted left by 11100010100101000110000= 3,230,256, no wrap
Shifted right by 111000101001010001100= 807,564, discarding the low bit
These bits as a double7.97979258 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,615,128 to the power 22,608,638,456,384
1,615,128 to the power 34,213,285,012,782,577,152
1,615,128 to the power 46,804,994,596,125,498,270,355,456
1,615,128 to the power 510,990,937,312,050,983,770,402,666,938,368
First ten multiples1,615,128, 3,230,256, 4,845,384, 6,460,512, 8,075,640, 9,690,768, 11,305,896, 12,921,024, 14,536,152, 16,151,280
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 3
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 6
Divisible by 10No, remainder 8
Divisible by 11No, remainder 9
Divisible by 12Yes
Divisible by 100No, remainder 28
Collatz (3n + 1) trajectory
Steps to reach 1207the total stopping time
Highest value reached1,615,128
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,615,128 → 807,564 → 403,782 → 201,891 → 605,674 → 302,837 → 908,512 → 454,256 → 227,128 → 113,564 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage161,512,800%
1,615,128% as a decimal16,151.28
1,615,128% of 1001,615,128
1,615,128% of 1,00016,151,280
As a fraction of 1001,615,128/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,615,128
Nerdulate something else
Nothing in mind? Surprise me · today’s page