Recognised as Number

1,320,331

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,320,331

Digit count7

Digit sum13

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,320,331

Distinct prime factors11,320,331

Number of divisors2

Sum of divisors σ(n)1,320,332

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,320,330the 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,320,3312 in total

Arithmetic

Previous number1,320,330

Next number1,320,332

Double2,640,662

Half660,165.5

Square1,743,273,949,561

Cube2,301,698,637,097,824,691

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

Cube root109.705299328≈

Negation-1,320,331

Reciprocal7.57385837 × 10^-7≈

Representations

Decimal1,320,331

Binary10100001001011000101121 bits

Octal5022613

Hexadecimal14258B

Base 36SARV

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

In wordsone million, three hundred and twenty thousand, three hundred and thirty-one

Ordinalone million, three hundred and twenty thousand, three hundred and thirty-first

Scientific notation1.320331 × 10^6

Engineering notation1.320331 × 10^6

In other bases

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

Quinary314222311base 5; one hand: 9 digits

Septenary14136235base 7: 8 digits

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

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

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

Sexagesimal6:6:45:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101000010010110001011

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

Bytes314 25 8b

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

At each machine width

32-bit00000000000101000010010110001011

64-bit0000000000000000000000000000000000000000000101000010010110001011

One's complement11111111111010111101101001110100at 32 bits, every bit flipped

Bits reversed11010001101001000010100000000000at 32 bits

Rotated left by 100000000001010000100101100010110at 32 bits, wrapping

Shifted left by 11010000100101100010110= 2,640,662, no wrap

Shifted right by 110100001001011000101= 660,165, discarding the low bit

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

Nearest landmarks

Next prime1,320,337+6

Previous prime1,320,307−24

Distance to nearest prime0, it is prime

Nearest square below1,320,201

Nearest square above1,322,500

Powers & multiples

1,320,331 to the power 21,743,273,949,561

1,320,331 to the power 32,301,698,637,097,824,691

1,320,331 to the power 43,039,004,063,218,007,972,092,721

1,320,331 to the power 54,012,491,273,792,695,683,801,154,410,651

First ten multiples1,320,331, 2,640,662, 3,960,993, 5,281,324, 6,601,655, 7,921,986, 9,242,317, 10,562,648, 11,882,979, 13,203,310

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 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 3

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 1

Divisible by 12No, remainder 7

Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 193the total stopping time

Highest value reached5,941,4924× the starting value

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

First steps1,320,331 → 3,960,994 → 1,980,497 → 5,941,492 → 2,970,746 → 1,485,373 → 4,456,120 → 2,228,060 → 1,114,030 → 557,015 → …

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

As a percentage & fraction

As a percentage132,033,100%

1,320,331% as a decimal13,203.31

1,320,331% of 1001,320,331

1,320,331% of 1,00013,203,310

As a fraction of 1001,320,331/100

Read another way

As seconds15 days, 6 hours and 45 minutes

As bytes1.259 MiB

As a 24-bit colour#14258B

Keep nerding

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