Recognised as Number

3,171,433

Positive
Odd
Prime
7 digits

3,171,433 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value3,171,433

Digit count7

Digit sum22

Digit product756

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3,171,433

Distinct prime factors13,171,433

Number of divisors2

Sum of divisors σ(n)3,171,434

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)3,171,432integers below n that share no factor with it

Carmichael function λ(n)3,171,432the 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, 3,171,4332 in total

Arithmetic

Previous number3,171,432

Next number3,171,434

Double6,342,866

Half1,585,716.5

Square10,057,987,273,489

Cube31,898,232,752,723,039,737

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

Cube root146.921441357≈

Negation-3,171,433

Reciprocal3.15314875 × 10^-7≈

Representations

Decimal3,171,433

Binary110000011001000110100122 bits

Octal14062151

Hexadecimal306469

Base 361VZ3D

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

In wordsthree million, one hundred and seventy-one thousand, four hundred and thirty-three

Ordinalthree million, one hundred and seventy-one thousand, four hundred and thirty-third

Scientific notation3.171433 × 10^6

Engineering notation3.171433 × 10^6

In other bases

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

Quinary1302441213base 5; one hand: 10 digits

Septenary35646106base 7: 8 digits

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

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

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

Sexagesimal14:40:57:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001100000110010001101001

Bit length22 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits13within that length

Bit parityodd9 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes330 64 69

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

At each machine width

32-bit00000000001100000110010001101001

64-bit0000000000000000000000000000000000000000001100000110010001101001

One's complement11111111110011111001101110010110at 32 bits, every bit flipped

Bits reversed10010110001001100000110000000000at 32 bits

Rotated left by 100000000011000001100100011010010at 32 bits, wrapping

Shifted left by 111000001100100011010010= 6,342,866, no wrap

Shifted right by 1110000011001000110100= 1,585,716, discarding the low bit

These bits as a double1.56689609 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,171,439+6

Previous prime3,171,431−2

Distance to nearest prime0, it is prime

Nearest square below3,168,400

Nearest square above3,171,961

Powers & multiples

3,171,433 to the power 210,057,987,273,489

3,171,433 to the power 331,898,232,752,723,039,737

3,171,433 to the power 4101,163,107,993,666,688,082,233,121

3,171,433 to the power 5320,832,019,073,678,325,584,700,833,632,393

First ten multiples3,171,433, 6,342,866, 9,514,299, 12,685,732, 15,857,165, 19,028,598, 22,200,031, 25,371,464, 28,542,897, 31,714,330

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 3

Divisible by 11No, remainder 1

Divisible by 12No, remainder 1

Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1270the total stopping time

Highest value reached24,083,0807× the starting value

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

First steps3,171,433 → 9,514,300 → 4,757,150 → 2,378,575 → 7,135,726 → 3,567,863 → 10,703,590 → 5,351,795 → 16,055,386 → 8,027,693 → …

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

As a percentage & fraction

As a percentage317,143,300%

3,171,433% as a decimal31,714.33

3,171,433% of 1003,171,433

3,171,433% of 1,00031,714,330

As a fraction of 1003,171,433/100

Read another way

As seconds36 days, 16 hours and 57 minutes

As bytes3.025 MiB

As a 24-bit colour#306469

Keep nerding

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