Recognised as Number

1,537,557

Positive
Odd
Composite
7 digits

1,537,557 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,537,557

Digit count7

Digit sum33

Digit product18,375

Multiplicative persistence3times 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 factorisation3 × 7 × 211 × 347

Distinct prime factors43, 7, 211, 347

Number of divisors16

Sum of divisors σ(n)2,360,832

Aliquot sum823,275sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)36,330the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 871,920

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 7, 21, 211, 347, 633, 1,041, 1,477, 2,429, 4,431, 7,287, 73,217, 219,651, 512,519, 1,537,55716 in total

Arithmetic

Previous number1,537,556

Next number1,537,558

Double3,075,114

Half768,778.5

Square2,364,081,528,249

Cube3,634,910,102,329,947,693

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

Cube root115.418938268≈

Negation-1,537,557

Reciprocal6.50382392 × 10^-7≈

Representations

Decimal1,537,557

Binary10111011101100001010121 bits

Octal5673025

Hexadecimal177615

Base 36WYDX

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

In wordsone million, five hundred and thirty-seven thousand, five hundred and fifty-seven

Ordinalone million, five hundred and thirty-seven thousand, five hundred and fifty-seventh

Scientific notation1.537557 × 10^6

Engineering notation1.537557 × 10^6

In other bases

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

Quinary343200212base 5; one hand: 9 digits

Septenary16032450base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101110111011000010101

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

Bit parityeven12 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 76 15

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

At each machine width

32-bit00000000000101110111011000010101

64-bit0000000000000000000000000000000000000000000101110111011000010101

One's complement11111111111010001000100111101010at 32 bits, every bit flipped

Bits reversed10101000011011101110100000000000at 32 bits

Rotated left by 100000000001011101110110000101010at 32 bits, wrapping

Shifted left by 11011101110110000101010= 3,075,114, no wrap

Shifted right by 110111011101100001010= 768,778, discarding the low bit

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

Nearest landmarks

Next prime1,537,559+2

Previous prime1,537,517−40

Distance to nearest prime2

Nearest square below1,535,121

Nearest square above1,537,600

Powers & multiples

1,537,557 to the power 22,364,081,528,249

1,537,557 to the power 33,634,910,102,329,947,693

1,537,557 to the power 45,588,881,472,208,127,385,006,001

1,537,557 to the power 58,593,223,829,763,911,717,707,671,879,557

First ten multiples1,537,557, 3,075,114, 4,612,671, 6,150,228, 7,687,785, 9,225,342, 10,762,899, 12,300,456, 13,838,013, 15,375,570

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 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 6

Divisible by 10No, remainder 7

Divisible by 11No, remainder 10

Divisible by 12No, remainder 9

Divisible by 100No, remainder 57

Collatz (3n + 1) trajectory

Steps to reach 1181the total stopping time

Highest value reached4,612,6723× the starting value

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

First steps1,537,557 → 4,612,672 → 2,306,336 → 1,153,168 → 576,584 → 288,292 → 144,146 → 72,073 → 216,220 → 108,110 → …

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

As a percentage & fraction

As a percentage153,755,700%

1,537,557% as a decimal15,375.57

1,537,557% of 1001,537,557

1,537,557% of 1,00015,375,570

As a fraction of 1001,537,557/100

Read another way

As seconds17 days, 19 hours and 5 minutes

As bytes1.466 MiB

As a 24-bit colour#177615

Keep nerding

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