Recognised as Number

1,322,965

Positive
Odd
Composite
7 digits

1,322,965 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,322,965

Digit count7

Digit sum28

Digit product3,240

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 7 × 37,799

Distinct prime factors35, 7, 37,799

Number of divisors8

Sum of divisors σ(n)1,814,400

Aliquot sum491,435sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)226,788the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 907,152

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 7, 35, 37,799, 188,995, 264,593, 1,322,9658 in total

Arithmetic

Previous number1,322,964

Next number1,322,966

Double2,645,930

Half661,482.5

Square1,750,236,391,225

Cube2,315,501,487,316,982,125

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

Cube root109.778203222≈

Negation-1,322,965

Reciprocal7.55877895 × 10^-7≈

Representations

Decimal1,322,965

Binary10100001011111101010121 bits

Octal5027725

Hexadecimal142FD5

Base 36SCT1

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

In wordsone million, three hundred and twenty-two thousand, nine hundred and sixty-five

Ordinalone million, three hundred and twenty-two thousand, nine hundred and sixty-fifth

Scientific notation1.322965 × 10^6

Engineering notation1.322965 × 10^6

In other bases

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

Quinary314313330base 5; one hand: 9 digits

Septenary14150020base 7: 8 digits

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

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

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

Sexagesimal6:7:29:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101000010111111010101

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

Bytes314 2f d5

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

At each machine width

32-bit00000000000101000010111111010101

64-bit0000000000000000000000000000000000000000000101000010111111010101

One's complement11111111111010111101000000101010at 32 bits, every bit flipped

Bits reversed10101011111101000010100000000000at 32 bits

Rotated left by 100000000001010000101111110101010at 32 bits, wrapping

Shifted left by 11010000101111110101010= 2,645,930, no wrap

Shifted right by 110100001011111101010= 661,482, discarding the low bit

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

Nearest landmarks

Next prime1,322,977+12

Previous prime1,322,963−2

Distance to nearest prime2

Nearest square below1,322,500

Nearest square above1,324,801

Powers & multiples

1,322,965 to the power 21,750,236,391,225

1,322,965 to the power 32,315,501,487,316,982,125

1,322,965 to the power 43,063,327,425,168,311,257,000,625

1,322,965 to the power 54,052,674,967,037,794,902,117,831,853,125

First ten multiples1,322,965, 2,645,930, 3,968,895, 5,291,860, 6,614,825, 7,937,790, 9,260,755, 10,583,720, 11,906,685, 13,229,650

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

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 5

Divisible by 11No, remainder 6

Divisible by 12No, remainder 1

Divisible by 100No, remainder 65

Collatz (3n + 1) trajectory

Steps to reach 1142the total stopping time

Highest value reached3,968,8963× the starting value

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

First steps1,322,965 → 3,968,896 → 1,984,448 → 992,224 → 496,112 → 248,056 → 124,028 → 62,014 → 31,007 → 93,022 → …

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

As a percentage & fraction

As a percentage132,296,500%

1,322,965% as a decimal13,229.65

1,322,965% of 1001,322,965

1,322,965% of 1,00013,229,650

As a fraction of 1001,322,965/100

Read another way

As seconds15 days, 7 hours and 29 minutes

As bytes1.262 MiB

As a 24-bit colour#142FD5

Keep nerding

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