Recognised as Number

1,595,393

Positive
Odd
Prime
7 digits

1,595,393 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,595,393

Digit count7

Digit sum35

Digit product18,225

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,595,393

Distinct prime factors11,595,393

Number of divisors2

Sum of divisors σ(n)1,595,394

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,595,392integers below n that share no factor with it

Carmichael function λ(n)1,595,392the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 1,595,3932 in total

Arithmetic

Previous number1,595,392

Next number1,595,394

Double3,190,786

Half797,696.5

Square2,545,278,824,449

Cube4,060,720,019,574,163,457

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

Cube root116.848343697≈

Negation-1,595,393

Reciprocal6.26804806 × 10^-7≈

Representations

Decimal1,595,393

Binary11000010110000000000121 bits

Octal6054001

Hexadecimal185801

Base 36Y70H

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

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

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

Scientific notation1.595393 × 10^6

Engineering notation1.595393 × 10^6

In other bases

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

Quinary402023033base 5; one hand: 9 digits

Septenary16363202base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000110000101100000000001

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 odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes318 58 01

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

At each machine width

32-bit00000000000110000101100000000001

64-bit0000000000000000000000000000000000000000000110000101100000000001

One's complement11111111111001111010011111111110at 32 bits, every bit flipped

Bits reversed10000000000110100001100000000000at 32 bits

Rotated left by 100000000001100001011000000000010at 32 bits, wrapping

Shifted left by 11100001011000000000010= 3,190,786, no wrap

Shifted right by 111000010110000000000= 797,696, discarding the low bit

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

Nearest landmarks

Next prime1,595,401+8

Previous prime1,595,389−4

Distance to nearest prime0, it is prime

Nearest square below1,595,169

Nearest square above1,597,696

Powers & multiples

1,595,393 to the power 22,545,278,824,449

1,595,393 to the power 34,060,720,019,574,163,457

1,595,393 to the power 46,478,444,294,188,483,360,153,601

1,595,393 to the power 510,335,664,677,838,247,033,405,533,960,193

First ten multiples1,595,393, 3,190,786, 4,786,179, 6,381,572, 7,976,965, 9,572,358, 11,167,751, 12,763,144, 14,358,537, 15,953,930

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 8

Divisible by 12No, remainder 5

Divisible by 100No, remainder 93

Collatz (3n + 1) trajectory

Steps to reach 1194the total stopping time

Highest value reached4,786,1803× the starting value

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

First steps1,595,393 → 4,786,180 → 2,393,090 → 1,196,545 → 3,589,636 → 1,794,818 → 897,409 → 2,692,228 → 1,346,114 → 673,057 → …

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

As a percentage & fraction

As a percentage159,539,300%

1,595,393% as a decimal15,953.93

1,595,393% of 1001,595,393

1,595,393% of 1,00015,953,930

As a fraction of 1001,595,393/100

Read another way

As seconds18 days, 11 hours and 9 minutes

As bytes1.521 MiB

As a 24-bit colour#185801

Keep nerding

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