Nerdulator> put something in

Recognised as Number

4,871,173

  • Positive
  • Odd
  • Prime
  • 7 digits

4,871,173 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 value4,871,173
Digit count7
Digit sum31
Digit product4,704
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation4,871,173
Distinct prime factors14,871,173
Number of divisors2
Sum of divisors σ(n)4,871,174
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,871,172integers below n that share no factor with it
Carmichael function λ(n)4,871,172the 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, 4,871,1732 in total

Arithmetic

Previous number4,871,172
Next number4,871,174
Double9,742,346
Cube115,584,782,875,036,654,717
Square root2,207.073401589≈irrational, shown to 9 decimal places
Cube root169.516190736≈
Negation-4,871,173
Reciprocal2.05289363 × 10^-7≈

Representations

Decimal4,871,173
Binary1001010010101000000010123 bits
Octal22452005
Hexadecimal4A5405
Base 362WEMD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, eight hundred and seventy-one thousand, one hundred and seventy-three
Ordinalfour million, eight hundred and seventy-one thousand, one hundred and seventy-third
Scientific notation4.871173 × 10^6
Engineering notation4.871173 × 10^6

In other bases

Ternary100011110222211base 3; the most digit-efficient integer base after e: 15 digits
Quinary2221334143base 5; one hand: 10 digits
Septenary56255446base 7: 8 digits
Nonary10143884base 9; each digit is two ternary digits: 8 digits
Duodecimal176ab71base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1a8hidbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal22:33:6:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100011111000T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111100101010000000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010010100101010000000101
Bit length23 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits15within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes34a 54 05
Gray code11011110111111000000111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010010100101010000000101
64-bit0000000000000000000000000000000000000000010010100101010000000101
One's complement11111111101101011010101111111010at 32 bits, every bit flipped
Bits reversed10100000001010100101001000000000at 32 bits
Rotated left by 100000000100101001010100000001010at 32 bits, wrapping
Shifted left by 1100101001010100000001010= 9,742,346, no wrap
Shifted right by 11001010010101000000010= 2,435,586, discarding the low bit
These bits as a double2.40667923 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,871,183+10
Previous prime4,871,149−24
Distance to nearest prime0, it is prime
Nearest square below4,870,849
Nearest square above4,875,264

Powers & multiples

4,871,173 to the power 223,728,326,395,929
4,871,173 to the power 3115,584,782,875,036,654,717
4,871,173 to the power 4563,033,473,551,740,926,467,773,041
4,871,173 to the power 52,742,633,454,461,454,504,004,801,407,447,093
First ten multiples4,871,173, 9,742,346, 14,613,519, 19,484,692, 24,355,865, 29,227,038, 34,098,211, 38,969,384, 43,840,557, 48,711,730
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

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 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 1206the total stopping time
Highest value reached14,613,5203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,871,173 → 14,613,520 → 7,306,760 → 3,653,380 → 1,826,690 → 913,345 → 2,740,036 → 1,370,018 → 685,009 → 2,055,028 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage487,117,300%
4,871,173% as a decimal48,711.73
4,871,173% of 1004,871,173
4,871,173% of 1,00048,711,730
As a fraction of 1004,871,173/100

Read another way

As bytes4.646 MiB
As a 24-bit colour#4A5405

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