Recognised as Number
2,731,965
- Positive
- Odd
- Composite
- 7 digits
2,731,965 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,731,965
Digit count7
Digit sum33
Digit product11,340
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 × 5 × 182,131
Distinct prime factors33, 5, 182,131
Number of divisors8
Sum of divisors σ(n)4,371,168
Aliquot sum1,639,203sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,457,040integers below n that share no factor with it
Carmichael function λ(n)364,260the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,457,040
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 182,131, 546,393, 910,655, 2,731,9658 in total
Arithmetic
Previous number2,731,964
Next number2,731,966
Double5,463,930
Half1,365,982.5
Square7,463,632,761,225
Cube20,390,383,476,520,057,125
Square root1,652.865693273≈irrational, shown to 9 decimal places
Cube root139.795023165≈
Negation-2,731,965
Reciprocal3.660369 × 10^-7≈
Representations
Decimal2,731,965
Binary101001101011111011110122 bits
Octal12327675
Hexadecimal29AFBD
Base 361MJZX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven hundred and thirty-one thousand, nine hundred and sixty-five
Ordinaltwo million, seven hundred and thirty-one thousand, nine hundred and sixty-fifth
Scientific notation2.731965 × 10^6
Engineering notation2.731965 × 10^6
In other bases
Ternary12010210112220base 3; the most digit-efficient integer base after e: 14 digits
Quinary1144410330base 5; one hand: 10 digits
Septenary32135625base 7: 8 digits
Nonary5123486base 9; each digit is two ternary digits: 7 digits
Duodecimalab8bb9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalh19i5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:38:52:45base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT011T11TT00T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111101111000011001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010011010111110111101
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 set bits, so odd; 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
Bytes329 af bd
Gray code1111010111100001100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010011010111110111101
64-bit0000000000000000000000000000000000000000001010011010111110111101
One's complement11111111110101100101000001000010at 32 bits, every bit flipped
Bits reversed10111101111101011001010000000000at 32 bits
Rotated left by 100000000010100110101111101111010at 32 bits, wrapping
Shifted left by 110100110101111101111010= 5,463,930, no wrap
Shifted right by 1101001101011111011110= 1,365,982, discarding the low bit
These bits as a double1.34977005 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,731,965 to the power 27,463,632,761,225
2,731,965 to the power 320,390,383,476,520,057,125
2,731,965 to the power 455,705,813,994,431,117,863,500,625
2,731,965 to the power 5152,186,334,129,296,008,913,958,484,978,125
First ten multiples2,731,965, 5,463,930, 8,195,895, 10,927,860, 13,659,825, 16,391,790, 19,123,755, 21,855,720, 24,587,685, 27,319,650
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 5
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 65
Collatz (3n + 1) trajectory
Steps to reach 1262the total stopping time
Highest value reached11,669,5604× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,731,965 → 8,195,896 → 4,097,948 → 2,048,974 → 1,024,487 → 3,073,462 → 1,536,731 → 4,610,194 → 2,305,097 → 6,915,292 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage273,196,500%
2,731,965% as a decimal27,319.65
2,731,965% of 1002,731,965
2,731,965% of 1,00027,319,650
As a fraction of 1002,731,965/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,731,965
Nerdulate something else
Nothing in mind? Surprise me · today’s page