Recognised as Number
3,167,893
- Positive
- Odd
- Composite
- 7 digits
3,167,893 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,167,893
Digit count7
Digit sum37
Digit product27,216
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation443 × 7,151
Distinct prime factors2443, 7,151
Number of divisors4
Sum of divisors σ(n)3,175,488
Aliquot sum7,595sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,160,300integers below n that share no factor with it
Carmichael function λ(n)121,550the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,160,300
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 443, 7,151, 3,167,8934 in total
Arithmetic
Previous number3,167,892
Next number3,167,894
Double6,335,786
Half1,583,946.5
Square10,035,546,059,449
Cube31,791,536,112,906,070,957
Square root1,779.857578572≈irrational, shown to 9 decimal places
Cube root146.866755717≈
Negation-3,167,893
Reciprocal3.15667227 × 10^-7≈
Representations
Decimal3,167,893
Binary110000010101101001010122 bits
Octal14053225
Hexadecimal305695
Base 361VWD1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, one hundred and sixty-seven thousand, eight hundred and ninety-three
Ordinalthree million, one hundred and sixty-seven thousand, eight hundred and ninety-third
Scientific notation3.167893 × 10^6
Engineering notation3.167893 × 10^6
In other bases
Ternary12221221112101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1302333033base 5; one hand: 10 digits
Septenary35632561base 7: 8 digits
Nonary5857471base 9; each digit is two ternary digits: 7 digits
Duodecimal1089331base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimaljfjedbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:39:58:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000T00TTTT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100011010101110010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100000101011010010101
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 95
Gray code1010000111110111011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100000101011010010101
64-bit0000000000000000000000000000000000000000001100000101011010010101
One's complement11111111110011111010100101101010at 32 bits, every bit flipped
Bits reversed10101001011010100000110000000000at 32 bits
Rotated left by 100000000011000001010110100101010at 32 bits, wrapping
Shifted left by 111000001010110100101010= 6,335,786, no wrap
Shifted right by 1110000010101101001010= 1,583,946, discarding the low bit
These bits as a double1.5651471 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,167,893 to the power 210,035,546,059,449
3,167,893 to the power 331,791,536,112,906,070,957
3,167,893 to the power 4100,712,184,711,322,351,842,183,601
3,167,893 to the power 5319,045,424,961,705,099,144,390,534,322,693
First ten multiples3,167,893, 6,335,786, 9,503,679, 12,671,572, 15,839,465, 19,007,358, 22,175,251, 25,343,144, 28,511,037, 31,678,930
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 93
Collatz (3n + 1) trajectory
Steps to reach 171the total stopping time
Highest value reached9,503,6803× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,167,893 → 9,503,680 → 4,751,840 → 2,375,920 → 1,187,960 → 593,980 → 296,990 → 148,495 → 445,486 → 222,743 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage316,789,300%
3,167,893% as a decimal31,678.93
3,167,893% of 1003,167,893
3,167,893% of 1,00031,678,930
As a fraction of 1003,167,893/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,893
Nerdulate something else
Nothing in mind? Surprise me · today’s page