Recognised as Number
4,171,031
- Positive
- Odd
- Prime
- 7 digits
4,171,031 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,171,031
Digit count7
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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,171,031
Distinct prime factors14,171,031
Number of divisors2
Sum of divisors σ(n)4,171,032
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,171,030integers below n that share no factor with it
Carmichael function λ(n)4,171,030the 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,171,0312 in total
Arithmetic
Previous number4,171,030
Next number4,171,032
Double8,342,062
Half2,085,515.5
Square17,397,499,602,961
Cube72,565,510,166,438,022,791
Square root2,042.310211501≈irrational, shown to 9 decimal places
Cube root160.97106073≈
Negation-4,171,031
Reciprocal2.39748877 × 10^-7≈
Representations
Decimal4,171,031
Binary111111101001010001011122 bits
Octal17722427
Hexadecimal3FA517
Base 362HEDZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and seventy-one thousand and thirty-one
Ordinalfour million, one hundred and seventy-one thousand and thirty-first
Scientific notation4.171031 × 10^6
Engineering notation4.171031 × 10^6
In other bases
Ternary21211220120122base 3; the most digit-efficient integer base after e: 14 digits
Quinary2031433111base 5; one hand: 10 digits
Septenary50311304base 7: 8 digits
Nonary7756518base 9; each digit is two ternary digits: 7 digits
Duodecimal149195bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1617bbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:18:37:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0TT0T1TT1T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001110010101101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111111010010100010111
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 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 a5 17
Gray code1000000111011110011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111111010010100010111
64-bit0000000000000000000000000000000000000000001111111010010100010111
One's complement11111111110000000101101011101000at 32 bits, every bit flipped
Bits reversed11101000101001011111110000000000at 32 bits
Rotated left by 100000000011111110100101000101110at 32 bits, wrapping
Shifted left by 111111110100101000101110= 8,342,062, no wrap
Shifted right by 1111111101001010001011= 2,085,515, discarding the low bit
These bits as a double2.06076312 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,171,031 to the power 217,397,499,602,961
4,171,031 to the power 372,565,510,166,438,022,791
4,171,031 to the power 4302,672,992,435,028,152,639,967,521
4,171,031 to the power 51,262,458,434,309,267,910,534,036,369,084,151
First ten multiples4,171,031, 8,342,062, 12,513,093, 16,684,124, 20,855,155, 25,026,186, 29,197,217, 33,368,248, 37,539,279, 41,710,310
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 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1136the total stopping time
Highest value reached28,154,4646× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,171,031 → 12,513,094 → 6,256,547 → 18,769,642 → 9,384,821 → 28,154,464 → 14,077,232 → 7,038,616 → 3,519,308 → 1,759,654 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage417,103,100%
4,171,031% as a decimal41,710.31
4,171,031% of 1004,171,031
4,171,031% of 1,00041,710,310
As a fraction of 1004,171,031/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 4,171,031
Nerdulate something else
Nothing in mind? Surprise me · today’s page