Recognised as Number

1,601,571

Positive
Odd
Composite
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,601,571

Digit count7

Digit sum21

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 × 533,857

Distinct prime factors23, 533,857

Number of divisors4

Sum of divisors σ(n)2,135,432

Aliquot sum533,861sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)533,856the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,067,712

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 533,857, 1,601,5714 in total

Arithmetic

Previous number1,601,570

Next number1,601,572

Double3,203,142

Half800,785.5

Square2,565,029,668,041

Cube4,108,077,130,474,092,411

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

Cube root116.998977272≈

Negation-1,601,571

Reciprocal6.2438693 × 10^-7≈

Representations

Decimal1,601,571

Binary11000011100000010001121 bits

Octal6070043

Hexadecimal187023

Base 36YBS3

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

In wordsone million, six hundred and one thousand, five hundred and seventy-one

Ordinalone million, six hundred and one thousand, five hundred and seventy-first

Scientific notation1.601571 × 10^6

Engineering notation1.601571 × 10^6

In other bases

Ternary10000100221110base 3; the most digit-efficient integer base after e: 14 digits

Quinary402222241base 5; one hand: 9 digits

Septenary16420206base 7: 8 digits

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

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

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

Sexagesimal7:24:52:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110000111000000100011

Bit length21 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits13within that length

Bit parityeven8 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

Bytes318 70 23

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

At each machine width

32-bit00000000000110000111000000100011

64-bit0000000000000000000000000000000000000000000110000111000000100011

One's complement11111111111001111000111111011100at 32 bits, every bit flipped

Bits reversed11000100000011100001100000000000at 32 bits

Rotated left by 100000000001100001110000001000110at 32 bits, wrapping

Shifted left by 11100001110000001000110= 3,203,142, no wrap

Shifted right by 111000011100000010001= 800,785, discarding the low bit

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

Nearest landmarks

Next prime1,601,573+2

Previous prime1,601,569−2

Distance to nearest prime2

Nearest square below1,600,225

Nearest square above1,602,756

Powers & multiples

1,601,571 to the power 22,565,029,668,041

1,601,571 to the power 34,108,077,130,474,092,411

1,601,571 to the power 46,579,377,197,930,522,656,777,681

1,601,571 to the power 510,537,339,718,266,785,101,938,087,336,851

First ten multiples1,601,571, 3,203,142, 4,804,713, 6,406,284, 8,007,855, 9,609,426, 11,210,997, 12,812,568, 14,414,139, 16,015,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 6

Divisible by 8No, remainder 3

Divisible by 9No, remainder 3

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 3

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 1163the total stopping time

Highest value reached7,207,0724× the starting value

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

First steps1,601,571 → 4,804,714 → 2,402,357 → 7,207,072 → 3,603,536 → 1,801,768 → 900,884 → 450,442 → 225,221 → 675,664 → …

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

As a percentage & fraction

As a percentage160,157,100%

1,601,571% as a decimal16,015.71

1,601,571% of 1001,601,571

1,601,571% of 1,00016,015,710

As a fraction of 1001,601,571/100

Read another way

As seconds18 days, 12 hours and 52 minutes

As bytes1.527 MiB

As a 24-bit colour#187023

Keep nerding

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