Nerdulator> put something in

Recognised as Number

1,571,991

  • Positive
  • Odd
  • Composite
  • 7 digits

1,571,991 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,571,991
Digit count7
Digit sum33
Digit product2,835
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 523,997
Distinct prime factors23, 523,997
Number of divisors4
Sum of divisors σ(n)2,095,992
Aliquot sum524,001sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,047,992integers below n that share no factor with it
Carmichael function λ(n)523,996the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,047,992
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 523,997, 1,571,9914 in total

Arithmetic

Previous number1,571,990
Next number1,571,992
Double3,143,982
Cube3,884,634,526,413,995,271
Square root1,253.790652382≈irrational, shown to 9 decimal places
Cube root116.274197761≈
Negation-1,571,991
Reciprocal6.36135958 × 10^-7≈

Representations

Decimal1,571,991
Binary10111111111001001011121 bits
Octal5776227
Hexadecimal17FC97
Base 36XOYF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and seventy-one thousand, nine hundred and ninety-one
Ordinalone million, five hundred and seventy-one thousand, nine hundred and ninety-first
Scientific notation1.571991 × 10^6
Engineering notation1.571991 × 10^6

In other bases

Ternary2221212100220base 3; the most digit-efficient integer base after e: 13 digits
Quinary400300431base 5; one hand: 9 digits
Septenary16235031base 7: 8 digits
Nonary2855326base 9; each digit is two ternary digits: 7 digits
Duodecimal639873base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9g9jbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:16:39:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1000T0TT1010T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010000000110111101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101111111110010010111
Bit length21 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits6within that length
Bit parityodd15 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
Bytes317 fc 97
Gray code111000000001011011100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101111111110010010111
64-bit0000000000000000000000000000000000000000000101111111110010010111
One's complement11111111111010000000001101101000at 32 bits, every bit flipped
Bits reversed11101001001111111110100000000000at 32 bits
Rotated left by 100000000001011111111100100101110at 32 bits, wrapping
Shifted left by 11011111111100100101110= 3,143,982, no wrap
Shifted right by 110111111111001001011= 785,995, discarding the low bit
These bits as a double7.76666749 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,572,017+26
Previous prime1,571,989−2
Distance to nearest prime2
Nearest square below1,570,009
Nearest square above1,572,516

Powers & multiples

1,571,991 to the power 22,471,155,704,081
1,571,991 to the power 33,884,634,526,413,995,271
1,571,991 to the power 46,106,610,513,812,062,840,054,561
1,571,991 to the power 59,599,536,768,217,938,476,000,209,400,951
First ten multiples1,571,991, 3,143,982, 4,715,973, 6,287,964, 7,859,955, 9,431,946, 11,003,937, 12,575,928, 14,147,919, 15,719,910
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 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 3
Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 1132the total stopping time
Highest value reached10,610,9446× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,571,991 → 4,715,974 → 2,357,987 → 7,073,962 → 3,536,981 → 10,610,944 → 5,305,472 → 2,652,736 → 1,326,368 → 663,184 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage157,199,100%
1,571,991% as a decimal15,719.91
1,571,991% of 1001,571,991
1,571,991% of 1,00015,719,910
As a fraction of 1001,571,991/100

Read another way

As bytes1.499 MiB
As a 24-bit colour#17FC97

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “1571991” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.