Recognised as Number
3,167,891
- Positive
- Odd
- Prime
- 7 digits
3,167,891 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 value3,167,891
Digit count7
Digit sum35
Digit product9,072
Multiplicative persistence2times 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 factorisation3,167,891
Distinct prime factors13,167,891
Number of divisors2
Sum of divisors σ(n)3,167,892
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,167,890integers below n that share no factor with it
Carmichael function λ(n)3,167,890the 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,167,8912 in total
Arithmetic
Previous number3,167,890
Next number3,167,892
Double6,335,782
Half1,583,945.5
Square10,035,533,387,881
Cube31,791,475,899,667,728,971
Square root1,779.857016729≈irrational, shown to 9 decimal places
Cube root146.866724809≈
Negation-3,167,891
Reciprocal3.15667427 × 10^-7≈
Representations
Decimal3,167,891
Binary110000010101101001001122 bits
Octal14053223
Hexadecimal305693
Base 361VWCZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, one hundred and sixty-seven thousand, eight hundred and ninety-one
Ordinalthree million, one hundred and sixty-seven thousand, eight hundred and ninety-first
Scientific notation3.167891 × 10^6
Engineering notation3.167891 × 10^6
In other bases
Ternary12221221112022base 3; the most digit-efficient integer base after e: 14 digits
Quinary1302333031base 5; one hand: 10 digits
Septenary35632556base 7: 8 digits
Nonary5857468base 9; each digit is two ternary digits: 7 digits
Duodecimal108932bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimaljfjebbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:39:58:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000T00TTTT10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100011010101110010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100000101011010010011
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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
Bytes330 56 93
Gray code1010000111110111011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100000101011010010011
64-bit0000000000000000000000000000000000000000001100000101011010010011
One's complement11111111110011111010100101101100at 32 bits, every bit flipped
Bits reversed11001001011010100000110000000000at 32 bits
Rotated left by 100000000011000001010110100100110at 32 bits, wrapping
Shifted left by 111000001010110100100110= 6,335,782, no wrap
Shifted right by 1110000010101101001001= 1,583,945, discarding the low bit
These bits as a double1.56514611 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,167,891 to the power 210,035,533,387,881
3,167,891 to the power 331,791,475,899,667,728,971
3,167,891 to the power 4100,711,930,379,274,301,597,670,161
3,167,891 to the power 5319,044,417,841,129,646,562,544,924,000,451
First ten multiples3,167,891, 6,335,782, 9,503,673, 12,671,564, 15,839,455, 19,007,346, 22,175,237, 25,343,128, 28,511,019, 31,678,910
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 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1102the total stopping time
Highest value reached14,255,5124× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,167,891 → 9,503,674 → 4,751,837 → 14,255,512 → 7,127,756 → 3,563,878 → 1,781,939 → 5,345,818 → 2,672,909 → 8,018,728 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage316,789,100%
3,167,891% as a decimal31,678.91
3,167,891% of 1003,167,891
3,167,891% of 1,00031,678,910
As a fraction of 1003,167,891/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 3,167,891
Nerdulate something else
Nothing in mind? Surprise me · today’s page