Recognised as Number

1,528,137

Positive
Odd
Composite
7 digits

1,528,137 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,528,137

Digit count7

Digit sum27

Digit product1,680

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 13 × 37 × 353

Distinct prime factors43, 13, 37, 353

Number of divisors24

Sum of divisors σ(n)2,448,264

Aliquot sum920,127sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)912,384integers below n that share no factor with it

Carmichael function λ(n)3,168the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 912,384

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 13, 37, 39, 111, 117, 333, 353, 481, 1,059, 1,443, 3,177, 4,329, 4,589, 13,061, 13,767, 39,183, 41,301, 117,549, 169,793, 509,379, 1,528,13724 in total

Arithmetic

Previous number1,528,136

Next number1,528,138

Double3,056,274

Half764,068.5

Square2,335,202,690,769

Cube3,568,509,634,263,667,353

Square root1,236.178385186≈irrational, shown to 9 decimal places

Cube root115.18274662≈

Negation-1,528,137

Reciprocal6.54391589 × 10^-7≈

Representations

Decimal1,528,137

Binary10111010100010100100121 bits

Octal5650511

Hexadecimal175149

Base 36WR49

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, five hundred and twenty-eight thousand, one hundred and thirty-seven

Ordinalone million, five hundred and twenty-eight thousand, one hundred and thirty-seventh

Scientific notation1.528137 × 10^6

Engineering notation1.528137 × 10^6

In other bases

Ternary2212122012200base 3; the most digit-efficient integer base after e: 13 digits

Quinary342400022base 5; one hand: 9 digits

Septenary15663132base 7: 8 digits

Nonary2778180base 9; each digit is two ternary digits: 7 digits

Duodecimal618409base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal9b06hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal7:4:28:57base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary100T0T0T1T0T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11010110101000101011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101110101000101001001

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 odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes317 51 49

Gray code111001111100111101101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101110101000101001001

64-bit0000000000000000000000000000000000000000000101110101000101001001

One's complement11111111111010001010111010110110at 32 bits, every bit flipped

Bits reversed10010010100010101110100000000000at 32 bits

Rotated left by 100000000001011101010001010010010at 32 bits, wrapping

Shifted left by 11011101010001010010010= 3,056,274, no wrap

Shifted right by 110111010100010100100= 764,068, discarding the low bit

These bits as a double7.54999994 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,528,139+2

Previous prime1,528,127−10

Distance to nearest prime2

Nearest square below1,527,696

Nearest square above1,530,169

Powers & multiples

1,528,137 to the power 22,335,202,690,769

1,528,137 to the power 33,568,509,634,263,667,353

1,528,137 to the power 45,453,171,606,974,777,837,811,361

1,528,137 to the power 58,333,193,299,967,616,080,739,539,764,457

First ten multiples1,528,137, 3,056,274, 4,584,411, 6,112,548, 7,640,685, 9,168,822, 10,696,959, 12,225,096, 13,753,233, 15,281,370

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 7

Divisible by 11No, remainder 6

Divisible by 12No, remainder 9

Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time

Highest value reached7,736,2005× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,528,137 → 4,584,412 → 2,292,206 → 1,146,103 → 3,438,310 → 1,719,155 → 5,157,466 → 2,578,733 → 7,736,200 → 3,868,100 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage152,813,700%

1,528,137% as a decimal15,281.37

1,528,137% of 1001,528,137

1,528,137% of 1,00015,281,370

As a fraction of 1001,528,137/100

Read another way

As seconds17 days, 16 hours and 28 minutes

As bytes1.457 MiB

As a 24-bit colour#175149

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.