Nerdulator> put something in

Recognised as Number

1,971,732

  • Positive
  • Even
  • Composite
  • 7 digits

1,971,732 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,971,732
Digit count7
Digit sum30
Digit product2,646
Multiplicative persistence5times 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 factorisation2^2 × 3 × 7 × 23,473
Distinct prime factors42, 3, 7, 23,473
Number of divisors24
Sum of divisors σ(n)5,258,176
Aliquot sum3,286,444sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)563,328integers below n that share no factor with it
Carmichael function λ(n)23,472the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 563,328
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 23,473, 46,946, 70,419, 93,892, 140,838, 164,311, 281,676, 328,622, 492,933, 657,244, 985,866, 1,971,73224 in total

Arithmetic

Previous number1,971,731
Next number1,971,733
Double3,943,464
Cube7,665,555,890,555,535,168
Square root1,404.18374866≈irrational, shown to 9 decimal places
Cube root125.395695413≈
Negation-1,971,732
Reciprocal5.07168317 × 10^-7≈

Representations

Decimal1,971,732
Binary11110000101100001010021 bits
Octal7413024
Hexadecimal1E1614
Base 36169EC
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and seventy-one thousand, seven hundred and thirty-two
Ordinalone million, nine hundred and seventy-one thousand, seven hundred and thirty-second
Scientific notation1.971732 × 10^6
Engineering notation1.971732 × 10^6

In other bases

Ternary10201011201010base 3; the most digit-efficient integer base after e: 14 digits
Quinary1001043412base 5; one hand: 10 digits
Septenary22521330base 7: 8 digits
Nonary3634633base 9; each digit is two ternary digits: 7 digits
Duodecimal7b1070base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc696cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:7:42:12base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T011TTT01010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000100110101000010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000111100001011000010100
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes31e 16 14
Gray code100010001110100011110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000111100001011000010100
64-bit0000000000000000000000000000000000000000000111100001011000010100
One's complement11111111111000011110100111101011at 32 bits, every bit flipped
Bits reversed00101000011010000111100000000000at 32 bits
Rotated left by 100000000001111000010110000101000at 32 bits, wrapping
Shifted left by 11111000010110000101000= 3,943,464, no wrap
Shifted right by 111110000101100001010= 985,866, discarding the low bit
These bits as a double9.74165044 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,971,799+67
Previous prime1,971,727−5
Distance to nearest prime5
Nearest square below1,971,216
Nearest square above1,974,025

Powers & multiples

1,971,732 to the power 23,887,727,079,824
1,971,732 to the power 37,665,555,890,555,535,168
1,971,732 to the power 415,114,421,847,196,846,467,870,976
1,971,732 to the power 529,801,589,217,617,132,479,788,175,250,432
First ten multiples1,971,732, 3,943,464, 5,915,196, 7,886,928, 9,858,660, 11,830,392, 13,802,124, 15,773,856, 17,745,588, 19,717,320
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8No, remainder 4
Divisible by 9No, remainder 3
Divisible by 10No, remainder 2
Divisible by 11No, remainder 4
Divisible by 12Yes
Divisible by 100No, remainder 32

Collatz (3n + 1) trajectory

Steps to reach 1140the total stopping time
Highest value reached1,971,732
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,971,732 → 985,866 → 492,933 → 1,478,800 → 739,400 → 369,700 → 184,850 → 92,425 → 277,276 → 138,638 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage197,173,200%
1,971,732% as a decimal19,717.32
1,971,732% of 1001,971,732
1,971,732% of 1,00019,717,320
As a fraction of 1001,971,732/100

Read another way

As bytes1.88 MiB
As a 24-bit colour#1E1614

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 “1971732” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.