Recognised as Number

1,320,201

Positive
Odd
Composite
Perfect square
7 digits

1,320,201 is an odd 7-digit integer and a composite number. It has 9 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,320,201

Digit count7

Digit sum9

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 1,149²

Happy numberYessquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 383^2

Distinct prime factors23, 383

Number of divisors9

Sum of divisors σ(n)1,911,949

Aliquot sum591,748sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)438,918the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 877,836

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 383, 1,149, 3,447, 146,689, 440,067, 1,320,2019 in total

Arithmetic

Previous number1,320,200

Next number1,320,202

Double2,640,402

Half660,100.5

Square1,742,930,680,401

Cube2,301,018,827,196,080,601

Square root1,149exact

Cube root109.701698676≈

Negation-1,320,201

Reciprocal7.57460417 × 10^-7≈

Representations

Decimal1,320,201

Binary10100001001010000100121 bits

Octal5022411

Hexadecimal142509

Base 36SAO9

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

In wordsone million, three hundred and twenty thousand, two hundred and one

Ordinalone million, three hundred and twenty thousand, two hundred and first

Scientific notation1.320201 × 10^6

Engineering notation1.320201 × 10^6

In other bases

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

Quinary314221301base 5; one hand: 9 digits

Septenary14135661base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101000010010100001001

Bit length21 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits14within that length

Bit parityodd7 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 09

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

At each machine width

32-bit00000000000101000010010100001001

64-bit0000000000000000000000000000000000000000000101000010010100001001

One's complement11111111111010111101101011110110at 32 bits, every bit flipped

Bits reversed10010000101001000010100000000000at 32 bits

Rotated left by 100000000001010000100101000010010at 32 bits, wrapping

Shifted left by 11010000100101000010010= 2,640,402, no wrap

Shifted right by 110100001001010000100= 660,100, discarding the low bit

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

Nearest landmarks

Next prime1,320,211+10

Previous prime1,320,199−2

Distance to nearest prime2

Nearest square below1,320,201

Nearest square above1,322,500

Powers & multiples

1,320,201 to the power 21,742,930,680,401

1,320,201 to the power 32,301,018,827,196,080,601

1,320,201 to the power 43,037,807,356,683,092,805,520,801

1,320,201 to the power 54,010,516,310,100,375,804,941,367,001,001

First ten multiples1,320,201, 2,640,402, 3,960,603, 5,280,804, 6,601,005, 7,921,206, 9,241,407, 10,561,608, 11,881,809, 13,202,010

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

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 1

Collatz (3n + 1) trajectory

Steps to reach 1168the total stopping time

Highest value reached14,274,30410× the starting value

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

First steps1,320,201 → 3,960,604 → 1,980,302 → 990,151 → 2,970,454 → 1,485,227 → 4,455,682 → 2,227,841 → 6,683,524 → 3,341,762 → …

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

As a percentage & fraction

As a percentage132,020,100%

1,320,201% as a decimal13,202.01

1,320,201% of 1001,320,201

1,320,201% of 1,00013,202,010

As a fraction of 1001,320,201/100

Read another way

As seconds15 days, 6 hours and 43 minutes

As bytes1.259 MiB

As a 24-bit colour#142509

Keep nerding

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