Recognised as Number

1,655,593

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,655,593

Digit count7

Digit sum34

Digit product20,250

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,655,593

Distinct prime factors11,655,593

Number of divisors2

Sum of divisors σ(n)1,655,594

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,655,592the 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,655,5932 in total

Arithmetic

Previous number1,655,592

Next number1,655,594

Double3,311,186

Half827,796.5

Square2,740,988,181,649

Cube4,537,960,846,620,812,857

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

Cube root118.299940764≈

Negation-1,655,593

Reciprocal6.04013184 × 10^-7≈

Representations

Decimal1,655,593

Binary11001010000110010100121 bits

Octal6241451

Hexadecimal194329

Base 36ZHGP

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

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

Ordinalone million, six hundred and fifty-five thousand, five hundred and ninety-third

Scientific notation1.655593 × 10^6

Engineering notation1.655593 × 10^6

In other bases

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

Quinary410434333base 5; one hand: 9 digits

Septenary20033542base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000110010100001100101001

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

Bit parityodd9 set bits, so odd; 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

Bytes319 43 29

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

At each machine width

32-bit00000000000110010100001100101001

64-bit0000000000000000000000000000000000000000000110010100001100101001

One's complement11111111111001101011110011010110at 32 bits, every bit flipped

Bits reversed10010100110000101001100000000000at 32 bits

Rotated left by 100000000001100101000011001010010at 32 bits, wrapping

Shifted left by 11100101000011001010010= 3,311,186, no wrap

Shifted right by 111001010000110010100= 827,796, discarding the low bit

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

Nearest landmarks

Next prime1,655,597+4

Previous prime1,655,587−6

Distance to nearest prime0, it is prime

Nearest square below1,653,796

Nearest square above1,656,369

Powers & multiples

1,655,593 to the power 22,740,988,181,649

1,655,593 to the power 34,537,960,846,620,812,857

1,655,593 to the power 47,513,016,211,939,491,420,359,201

1,655,593 to the power 512,438,497,049,373,538,419,106,750,661,193

First ten multiples1,655,593, 3,311,186, 4,966,779, 6,622,372, 8,277,965, 9,933,558, 11,589,151, 13,244,744, 14,900,337, 16,555,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 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 3

Divisible by 11No, remainder 5

Divisible by 12No, remainder 1

Divisible by 100No, remainder 93

Collatz (3n + 1) trajectory

Steps to reach 188the total stopping time

Highest value reached18,858,25611× the starting value

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

First steps1,655,593 → 4,966,780 → 2,483,390 → 1,241,695 → 3,725,086 → 1,862,543 → 5,587,630 → 2,793,815 → 8,381,446 → 4,190,723 → …

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

As a percentage & fraction

As a percentage165,559,300%

1,655,593% as a decimal16,555.93

1,655,593% of 1001,655,593

1,655,593% of 1,00016,555,930

As a fraction of 1001,655,593/100

Read another way

As seconds19 days, 3 hours and 53 minutes

As bytes1.579 MiB

As a 24-bit colour#194329

Keep nerding

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