Recognised as Number

2,595,321

Positive
Odd
Composite
Perfect square
7 digits

2,595,321 is an odd 7-digit integer and a composite number. It has 15 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value2,595,321

Digit count7

Digit sum27

Digit product2,700

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 1,611²

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^4 × 179^2

Distinct prime factors23, 179

Number of divisors15

Sum of divisors σ(n)3,898,741

Aliquot sum1,303,420sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 27, 81, 179, 537, 1,611, 4,833, 14,499, 32,041, 96,123, 288,369, 865,107, 2,595,32115 in total

Arithmetic

Previous number2,595,320

Next number2,595,322

Double5,190,642

Half1,297,660.5

Square6,735,691,093,041

Cube17,481,280,543,282,261,161

Square root1,611exact

Cube root137.424350674≈

Negation-2,595,321

Reciprocal3.85308792 × 10^-7≈

Representations

Decimal2,595,321

Binary100111100110011111100122 bits

Octal11714771

Hexadecimal2799F9

Base 361JMK9

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

In wordstwo million, five hundred and ninety-five thousand, three hundred and twenty-one

Ordinaltwo million, five hundred and ninety-five thousand, three hundred and twenty-first

Scientific notation2.595321 × 10^6

Engineering notation2.595321 × 10^6

In other bases

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

Quinary1131022241base 5; one hand: 10 digits

Septenary31026351base 7: 8 digits

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

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

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

Sexagesimal12:0:55:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001001111001100111111001

Bit length22 bitsto write the magnitude

Set bits14the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes327 99 f9

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

At each machine width

32-bit00000000001001111001100111111001

64-bit0000000000000000000000000000000000000000001001111001100111111001

One's complement11111111110110000110011000000110at 32 bits, every bit flipped

Bits reversed10011111100110011110010000000000at 32 bits

Rotated left by 100000000010011110011001111110010at 32 bits, wrapping

Shifted left by 110011110011001111110010= 5,190,642, no wrap

Shifted right by 1100111100110011111100= 1,297,660, discarding the low bit

These bits as a double1.28225895 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,595,323+2

Previous prime2,595,319−2

Distance to nearest prime2

Nearest square below2,595,321

Nearest square above2,598,544

Powers & multiples

2,595,321 to the power 26,735,691,093,041

2,595,321 to the power 317,481,280,543,282,261,161

2,595,321 to the power 445,369,534,500,871,861,318,627,681

2,595,321 to the power 5117,748,505,650,337,259,989,322,111,680,601

First ten multiples2,595,321, 5,190,642, 7,785,963, 10,381,284, 12,976,605, 15,571,926, 18,167,247, 20,762,568, 23,357,889, 25,953,210

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 3

Divisible by 12No, remainder 9

Divisible by 100No, remainder 21

Collatz (3n + 1) trajectory

Steps to reach 1218the total stopping time

Highest value reached28,061,15210× the starting value

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

First steps2,595,321 → 7,785,964 → 3,892,982 → 1,946,491 → 5,839,474 → 2,919,737 → 8,759,212 → 4,379,606 → 2,189,803 → 6,569,410 → …

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

As a percentage & fraction

As a percentage259,532,100%

2,595,321% as a decimal25,953.21

2,595,321% of 1002,595,321

2,595,321% of 1,00025,953,210

As a fraction of 1002,595,321/100

Read another way

As seconds30 days, 55 minutes and 21 seconds

As bytes2.475 MiB

As a 24-bit colour#2799F9

Keep nerding

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