Recognised as Number

1,320,533

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,320,533

Digit count7

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,320,533

Distinct prime factors11,320,533

Number of divisors2

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

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number1,320,532

Next number1,320,534

Double2,641,066

Half660,266.5

Square1,743,807,404,089

Cube2,302,755,222,743,859,437

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

Cube root109.710893718≈

Negation-1,320,533

Reciprocal7.57269981 × 10^-7≈

Representations

Decimal1,320,533

Binary10100001001100101010121 bits

Octal5023125

Hexadecimal142655

Base 36SAXH

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

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

Ordinalone million, three hundred and twenty thousand, five hundred and thirty-third

Scientific notation1.320533 × 10^6

Engineering notation1.320533 × 10^6

In other bases

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

Quinary314224113base 5; one hand: 9 digits

Septenary14136644base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101000010011001010101

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 26 55

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

At each machine width

32-bit00000000000101000010011001010101

64-bit0000000000000000000000000000000000000000000101000010011001010101

One's complement11111111111010111101100110101010at 32 bits, every bit flipped

Bits reversed10101010011001000010100000000000at 32 bits

Rotated left by 100000000001010000100110010101010at 32 bits, wrapping

Shifted left by 11010000100110010101010= 2,641,066, no wrap

Shifted right by 110100001001100101010= 660,266, discarding the low bit

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

Nearest landmarks

Next prime1,320,541+8

Previous prime1,320,437−96

Distance to nearest prime0, it is prime

Nearest square below1,320,201

Nearest square above1,322,500

Powers & multiples

1,320,533 to the power 21,743,807,404,089

1,320,533 to the power 32,302,755,222,743,859,437

1,320,533 to the power 43,040,864,262,555,616,933,919,921

1,320,533 to the power 54,015,561,607,225,356,496,600,075,037,893

First ten multiples1,320,533, 2,641,066, 3,961,599, 5,282,132, 6,602,665, 7,923,198, 9,243,731, 10,564,264, 11,884,797, 13,205,330

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 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 5

Divisible by 12No, remainder 5

Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1186the total stopping time

Highest value reached3,961,6003× the starting value

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

First steps1,320,533 → 3,961,600 → 1,980,800 → 990,400 → 495,200 → 247,600 → 123,800 → 61,900 → 30,950 → 15,475 → …

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

As a percentage & fraction

As a percentage132,053,300%

1,320,533% as a decimal13,205.33

1,320,533% of 1001,320,533

1,320,533% of 1,00013,205,330

As a fraction of 1001,320,533/100

Read another way

As seconds15 days, 6 hours and 48 minutes

As bytes1.259 MiB

As a 24-bit colour#142655

Keep nerding

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