Recognised as Number

1,595,394

Positive
Even
Composite
7 digits

1,595,394 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,595,394

Digit count7

Digit sum36

Digit product24,300

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 factorisation2 × 3^2 × 61 × 1,453

Distinct prime factors42, 3, 61, 1,453

Number of divisors24

Sum of divisors σ(n)3,515,772

Aliquot sum1,920,378sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)7,260the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 522,720

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 6, 9, 18, 61, 122, 183, 366, 549, 1,098, 1,453, 2,906, 4,359, 8,718, 13,077, 26,154, 88,633, 177,266, 265,899, 531,798, 797,697, 1,595,39424 in total

Arithmetic

Previous number1,595,393

Next number1,595,395

Double3,190,788

Half797,697

Square2,545,282,015,236

Cube4,060,727,655,415,422,984

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

Cube root116.848368111≈

Negation-1,595,394

Reciprocal6.26804413 × 10^-7≈

Representations

Decimal1,595,394

Binary11000010110000000001021 bits

Octal6054002

Hexadecimal185802

Base 36Y70I

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

In wordsone million, five hundred and ninety-five thousand, three hundred and ninety-four

Ordinalone million, five hundred and ninety-five thousand, three hundred and ninety-fourth

Scientific notation1.595394 × 10^6

Engineering notation1.595394 × 10^6

In other bases

Ternary10000001110200base 3; the most digit-efficient integer base after e: 14 digits

Quinary402023034base 5; one hand: 9 digits

Septenary16363203base 7: 8 digits

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

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

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

Sexagesimal7:23:9:54base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110000101100000000010

Bit length21 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits15within that length

Bit parityeven6 set bits, so even; not the same as the number itself being even

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes318 58 02

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

At each machine width

32-bit00000000000110000101100000000010

64-bit0000000000000000000000000000000000000000000110000101100000000010

One's complement11111111111001111010011111111101at 32 bits, every bit flipped

Bits reversed01000000000110100001100000000000at 32 bits

Rotated left by 100000000001100001011000000000100at 32 bits, wrapping

Shifted left by 11100001011000000000100= 3,190,788, no wrap

Shifted right by 111000010110000000001= 797,697, discarding the low bit

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

Nearest landmarks

Next prime1,595,401+7

Previous prime1,595,393−1

Distance to nearest prime1

Nearest square below1,595,169

Nearest square above1,597,696

Powers & multiples

1,595,394 to the power 22,545,282,015,236

1,595,394 to the power 34,060,727,655,415,422,984

1,595,394 to the power 46,478,460,537,083,833,336,135,696

1,595,394 to the power 510,335,697,070,100,325,201,470,872,584,224

First ten multiples1,595,394, 3,190,788, 4,786,182, 6,381,576, 7,976,970, 9,572,364, 11,167,758, 12,763,152, 14,358,546, 15,953,940

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 4

Divisible by 6Yes

Divisible by 7No, remainder 3

Divisible by 8No, remainder 2

Divisible by 9Yes

Divisible by 10No, remainder 4

Divisible by 11No, remainder 9

Divisible by 12No, remainder 6

Divisible by 100No, remainder 94

Collatz (3n + 1) trajectory

Steps to reach 1101the total stopping time

Highest value reached2,393,0921× the starting value

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

First steps1,595,394 → 797,697 → 2,393,092 → 1,196,546 → 598,273 → 1,794,820 → 897,410 → 448,705 → 1,346,116 → 673,058 → …

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

As a percentage & fraction

As a percentage159,539,400%

1,595,394% as a decimal15,953.94

1,595,394% of 1001,595,394

1,595,394% of 1,00015,953,940

As a fraction of 1001,595,394/100

Read another way

As seconds18 days, 11 hours and 9 minutes

As bytes1.521 MiB

As a 24-bit colour#185802

Keep nerding

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