Recognised as Number
5,167,671
- Positive
- Odd
- Composite
- 7 digits
5,167,671 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value5,167,671
Digit count7
Digit sum33
Digit product8,820
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 1,722,557
Distinct prime factors23, 1,722,557
Number of divisors4
Sum of divisors σ(n)6,890,232
Aliquot sum1,722,561sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,445,112integers below n that share no factor with it
Carmichael function λ(n)1,722,556the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,445,112
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 1,722,557, 5,167,6714 in total
Arithmetic
Previous number5,167,670
Next number5,167,672
Double10,335,342
Half2,583,835.5
Square26,704,823,564,241
Cube138,001,742,293,044,852,711
Square root2,273.251195975≈irrational, shown to 9 decimal places
Cube root172.888040538≈
Negation-5,167,671
Reciprocal1.93510771 × 10^-7≈
Representations
Decimal5,167,671
Binary1001110110110100011011123 bits
Octal23555067
Hexadecimal4EDA37
Base 3632REF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, one hundred and sixty-seven thousand, six hundred and seventy-one
Ordinalfive million, one hundred and sixty-seven thousand, six hundred and seventy-first
Scientific notation5.167671 × 10^6
Engineering notation5.167671 × 10^6
In other bases
Ternary100201112201020base 3; the most digit-efficient integer base after e: 15 digits
Quinary2310331141base 5; one hand: 10 digits
Septenary61632045base 7: 8 digits
Nonary10645636base 9; each digit is two ternary digits: 8 digits
Duodecimal1892673base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1c5j3bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal23:55:27:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101T1TTT0T011T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100110010111001001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010011101101101000110111
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 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
Bytes34e da 37
Gray code11010011011011100101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010011101101101000110111
64-bit0000000000000000000000000000000000000000010011101101101000110111
One's complement11111111101100010010010111001000at 32 bits, every bit flipped
Bits reversed11101100010110110111001000000000at 32 bits
Rotated left by 100000000100111011011010001101110at 32 bits, wrapping
Shifted left by 1100111011011010001101110= 10,335,342, no wrap
Shifted right by 11001110110110100011011= 2,583,835, discarding the low bit
These bits as a double2.55316871 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,167,671 to the power 226,704,823,564,241
5,167,671 to the power 3138,001,742,293,044,852,711
5,167,671 to the power 4713,147,601,597,241,387,053,906,081
5,167,671 to the power 53,685,312,179,493,617,995,878,245,891,507,351
First ten multiples5,167,671, 10,335,342, 15,503,013, 20,670,684, 25,838,355, 31,006,026, 36,173,697, 41,341,368, 46,509,039, 51,676,710
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1250the total stopping time
Highest value reached66,220,90012× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,167,671 → 15,503,014 → 7,751,507 → 23,254,522 → 11,627,261 → 34,881,784 → 17,440,892 → 8,720,446 → 4,360,223 → 13,080,670 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage516,767,100%
5,167,671% as a decimal51,676.71
5,167,671% of 1005,167,671
5,167,671% of 1,00051,676,710
As a fraction of 1005,167,671/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 5,167,671
Nerdulate something else
Nothing in mind? Surprise me · today’s page