Nerdulator> put something in

Recognised as Number

4,172,471

  • Positive
  • Odd
  • Prime
  • 7 digits

4,172,471 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,172,471
Digit count7
Digit sum26
Digit product1,568
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

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

Arithmetic

Previous number4,172,470
Next number4,172,472
Double8,344,942
Cube72,640,693,314,858,443,111
Square root2,042.662723016≈irrational, shown to 9 decimal places
Cube root160.989583061≈
Negation-4,172,471
Reciprocal2.39666135 × 10^-7≈

Representations

Decimal4,172,471
Binary111111101010101011011122 bits
Octal17725267
Hexadecimal3FAAB7
Base 362HFHZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and seventy-two thousand, four hundred and seventy-one
Ordinalfour million, one hundred and seventy-two thousand, four hundred and seventy-first
Scientific notation4.172471 × 10^6
Engineering notation4.172471 × 10^6

In other bases

Ternary21211222112222base 3; the most digit-efficient integer base after e: 14 digits
Quinary2032004341base 5; one hand: 10 digits
Septenary50315432base 7: 8 digits
Nonary7758488base 9; each digit is two ternary digits: 7 digits
Duodecimal149275bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal161b3bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:19:1:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0TT000TT000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001111111111001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001111111010101010110111
Bit length22 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits6within that length
Bit parityeven16 set bits, so even; 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
Bytes33f aa b7
Gray code1000000111111111101100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001111111010101010110111
64-bit0000000000000000000000000000000000000000001111111010101010110111
One's complement11111111110000000101010101001000at 32 bits, every bit flipped
Bits reversed11101101010101011111110000000000at 32 bits
Rotated left by 100000000011111110101010101101110at 32 bits, wrapping
Shifted left by 111111110101010101101110= 8,344,942, no wrap
Shifted right by 1111111101010101011011= 2,086,235, discarding the low bit
These bits as a double2.06147458 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,172,479+8
Previous prime4,172,431−40
Distance to nearest prime0, it is prime
Nearest square below4,169,764
Nearest square above4,173,849

Powers & multiples

4,172,471 to the power 217,409,514,245,841
4,172,471 to the power 372,640,693,314,858,443,111
4,172,471 to the power 4303,091,186,276,140,722,985,797,281
4,172,471 to the power 51,264,639,185,092,795,158,577,272,566,851,351
First ten multiples4,172,471, 8,344,942, 12,517,413, 16,689,884, 20,862,355, 25,034,826, 29,207,297, 33,379,768, 37,552,239, 41,724,710
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 1180the total stopping time
Highest value reached28,164,1846× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,172,471 → 12,517,414 → 6,258,707 → 18,776,122 → 9,388,061 → 28,164,184 → 14,082,092 → 7,041,046 → 3,520,523 → 10,561,570 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage417,247,100%
4,172,471% as a decimal41,724.71
4,172,471% of 1004,172,471
4,172,471% of 1,00041,724,710
As a fraction of 1004,172,471/100

Read another way

As bytes3.979 MiB
As a 24-bit colour#3FAAB7

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