Recognised as Number

1,331,549

Positive
Odd
Prime
7 digits

1,331,549 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,331,549

Digit count7

Digit sum26

Digit product1,620

Multiplicative persistence2times 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,331,549

Distinct prime factors11,331,549

Number of divisors2

Sum of divisors σ(n)1,331,550

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,331,548the 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,331,5492 in total

Arithmetic

Previous number1,331,548

Next number1,331,550

Double2,663,098

Half665,774.5

Square1,773,022,739,401

Cube2,360,866,655,626,662,149

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

Cube root110.015121888≈

Negation-1,331,549

Reciprocal7.51005032 × 10^-7≈

Representations

Decimal1,331,549

Binary10100010100010101110121 bits

Octal5050535

Hexadecimal14515D

Base 36SJFH

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

In wordsone million, three hundred and thirty-one thousand, five hundred and forty-nine

Ordinalone million, three hundred and thirty-one thousand, five hundred and forty-ninth

Scientific notation1.331549 × 10^6

Engineering notation1.331549 × 10^6

In other bases

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

Quinary320102144base 5; one hand: 9 digits

Septenary14214032base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101000101000101011101

Bit length21 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits11within that length

Bit parityeven10 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 51 5d

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

At each machine width

32-bit00000000000101000101000101011101

64-bit0000000000000000000000000000000000000000000101000101000101011101

One's complement11111111111010111010111010100010at 32 bits, every bit flipped

Bits reversed10111010100010100010100000000000at 32 bits

Rotated left by 100000000001010001010001010111010at 32 bits, wrapping

Shifted left by 11010001010001010111010= 2,663,098, no wrap

Shifted right by 110100010100010101110= 665,774, discarding the low bit

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

Nearest landmarks

Next prime1,331,567+18

Previous prime1,331,527−22

Distance to nearest prime0, it is prime

Nearest square below1,329,409

Nearest square above1,331,716

Powers & multiples

1,331,549 to the power 21,773,022,739,401

1,331,549 to the power 32,360,866,655,626,662,149

1,331,549 to the power 43,143,609,634,433,026,357,838,801

1,331,549 to the power 54,185,870,265,119,661,813,753,897,632,749

First ten multiples1,331,549, 2,663,098, 3,994,647, 5,326,196, 6,657,745, 7,989,294, 9,320,843, 10,652,392, 11,983,941, 13,315,490

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 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 9

Divisible by 11No, remainder 10

Divisible by 12No, remainder 5

Divisible by 100No, remainder 49

Collatz (3n + 1) trajectory

Steps to reach 1155the total stopping time

Highest value reached3,994,6483× the starting value

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

First steps1,331,549 → 3,994,648 → 1,997,324 → 998,662 → 499,331 → 1,497,994 → 748,997 → 2,246,992 → 1,123,496 → 561,748 → …

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

As a percentage & fraction

As a percentage133,154,900%

1,331,549% as a decimal13,315.49

1,331,549% of 1001,331,549

1,331,549% of 1,00013,315,490

As a fraction of 1001,331,549/100

Read another way

As seconds15 days, 9 hours and 52 minutes

As bytes1.27 MiB

As a 24-bit colour#14515D

Keep nerding

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