Recognised as Number
2,167,313
- Positive
- Odd
- Composite
- 7 digits
2,167,313 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,167,313
Digit count7
Digit sum23
Digit product756
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation17 × 23^2 × 241
Distinct prime factors317, 23, 241
Number of divisors12
Sum of divisors σ(n)2,408,868
Aliquot sum241,555sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,943,040integers below n that share no factor with it
Carmichael function λ(n)60,720the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,943,040
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 17, 23, 241, 391, 529, 4,097, 5,543, 8,993, 94,231, 127,489, 2,167,31312 in total
Arithmetic
Previous number2,167,312
Next number2,167,314
Double4,334,626
Half1,083,656.5
Square4,697,245,639,969
Cube10,180,401,539,698,133,297
Square root1,472.179676534≈irrational, shown to 9 decimal places
Cube root129.411800231≈
Negation-2,167,313
Reciprocal4.61400822 × 10^-7≈
Representations
Decimal2,167,313
Binary100001000100100001000122 bits
Octal10211021
Hexadecimal211211
Base 361AGB5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and sixty-seven thousand, three hundred and thirteen
Ordinaltwo million, one hundred and sixty-seven thousand, three hundred and thirteenth
Scientific notation2.167313 × 10^6
Engineering notation2.167313 × 10^6
In other bases
Ternary11002002222212base 3; the most digit-efficient integer base after e: 14 digits
Quinary1023323223base 5; one hand: 10 digits
Septenary24264461base 7: 8 digits
Nonary4062885base 9; each digit is two ternary digits: 7 digits
Duodecimal886295base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldai5dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:2:1:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1101T0100000TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000010001011000010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000010001001000010001
Bit length22 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits16within that length
Bit parityeven6 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
Bytes321 12 11
Gray code1100011001101100011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000010001001000010001
64-bit0000000000000000000000000000000000000000001000010001001000010001
One's complement11111111110111101110110111101110at 32 bits, every bit flipped
Bits reversed10001000010010001000010000000000at 32 bits
Rotated left by 100000000010000100010010000100010at 32 bits, wrapping
Shifted left by 110000100010010000100010= 4,334,626, no wrap
Shifted right by 1100001000100100001000= 1,083,656, discarding the low bit
These bits as a double1.0707949 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,167,313 to the power 24,697,245,639,969
2,167,313 to the power 310,180,401,539,698,133,297
2,167,313 to the power 422,064,116,602,207,780,370,320,961
2,167,313 to the power 547,819,846,745,480,751,097,741,432,947,793
First ten multiples2,167,313, 4,334,626, 6,501,939, 8,669,252, 10,836,565, 13,003,878, 15,171,191, 17,338,504, 19,505,817, 21,673,130
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1210the total stopping time
Highest value reached6,501,9403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,167,313 → 6,501,940 → 3,250,970 → 1,625,485 → 4,876,456 → 2,438,228 → 1,219,114 → 609,557 → 1,828,672 → 914,336 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage216,731,300%
2,167,313% as a decimal21,673.13
2,167,313% of 1002,167,313
2,167,313% of 1,00021,673,130
As a fraction of 1002,167,313/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 2,167,313
Nerdulate something else
Nothing in mind? Surprise me · today’s page