Recognised as Number
1,331,571
- Positive
- Odd
- Composite
- 7 digits
1,331,571 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,331,571
Digit count7
Digit sum21
Digit product315
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 59 × 7,523
Distinct prime factors33, 59, 7,523
Number of divisors8
Sum of divisors σ(n)1,805,760
Aliquot sum474,189sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)872,552integers below n that share no factor with it
Carmichael function λ(n)218,138the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 872,552
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 59, 177, 7,523, 22,569, 443,857, 1,331,5718 in total
Arithmetic
Previous number1,331,570
Next number1,331,572
Double2,663,142
Half665,785.5
Square1,773,081,328,041
Cube2,360,983,677,060,882,411
Square root1,153.937173333≈irrational, shown to 9 decimal places
Cube root110.015727779≈
Negation-1,331,571
Reciprocal7.50992625 × 10^-7≈
Representations
Decimal1,331,571
Binary10100010100010111001121 bits
Octal5050563
Hexadecimal145173
Base 36SJG3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and thirty-one thousand, five hundred and seventy-one
Ordinalone million, three hundred and thirty-one thousand, five hundred and seventy-first
Scientific notation1.331571 × 10^6
Engineering notation1.331571 × 10^6
In other bases
Ternary2111122120110base 3; the most digit-efficient integer base after e: 13 digits
Quinary320102241base 5; one hand: 9 digits
Septenary14214063base 7: 8 digits
Nonary2448513base 9; each digit is two ternary digits: 7 digits
Duodecimal542703base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal868ibbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:9:52:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTTT00TT0110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000101011010110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000101000101110011
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 73
Gray code111100111100111001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000101000101110011
64-bit0000000000000000000000000000000000000000000101000101000101110011
One's complement11111111111010111010111010001100at 32 bits, every bit flipped
Bits reversed11001110100010100010100000000000at 32 bits
Rotated left by 100000000001010001010001011100110at 32 bits, wrapping
Shifted left by 11010001010001011100110= 2,663,142, no wrap
Shifted right by 110100010100010111001= 665,785, discarding the low bit
These bits as a double6.57883486 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,331,571 to the power 21,773,081,328,041
1,331,571 to the power 32,360,983,677,060,882,411
1,331,571 to the power 43,143,817,395,847,636,252,897,681
1,331,571 to the power 54,186,216,073,606,232,852,907,217,986,851
First ten multiples1,331,571, 2,663,142, 3,994,713, 5,326,284, 6,657,855, 7,989,426, 9,320,997, 10,652,568, 11,984,139, 13,315,710
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1155the total stopping time
Highest value reached5,992,0724× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,331,571 → 3,994,714 → 1,997,357 → 5,992,072 → 2,996,036 → 1,498,018 → 749,009 → 2,247,028 → 1,123,514 → 561,757 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage133,157,100%
1,331,571% as a decimal13,315.71
1,331,571% of 1001,331,571
1,331,571% of 1,00013,315,710
As a fraction of 1001,331,571/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,331,571
Nerdulate something else
Nothing in mind? Surprise me · today’s page