Recognised as Number
2,777,053
- Positive
- Odd
- Composite
- 7 digits
2,777,053 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,777,053
Digit count7
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation41 × 67,733
Distinct prime factors241, 67,733
Number of divisors4
Sum of divisors σ(n)2,844,828
Aliquot sum67,775sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,709,280integers below n that share no factor with it
Carmichael function λ(n)677,320the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,709,280
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 41, 67,733, 2,777,0534 in total
Arithmetic
Previous number2,777,052
Next number2,777,054
Double5,554,106
Half1,388,526.5
Square7,712,023,364,809
Cube21,416,697,621,312,927,877
Square root1,666.449219148≈irrational, shown to 9 decimal places
Cube root140.559883795≈
Negation-2,777,053
Reciprocal3.60093956 × 10^-7≈
Representations
Decimal2,777,053
Binary101010010111111101110122 bits
Octal12457735
Hexadecimal2A5FDD
Base 361NISD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven hundred and seventy-seven thousand and fifty-three
Ordinaltwo million, seven hundred and seventy-seven thousand and fifty-third
Scientific notation2.777053 × 10^6
Engineering notation2.777053 × 10^6
In other bases
Ternary12020002101211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1202331203base 5; one hand: 10 digits
Septenary32414236base 7: 8 digits
Nonary5202354base 9; each digit is two ternary digits: 7 digits
Duodecimalb1b111base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalh72cdbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:51:24:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1T001T11TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111111010000000101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010100101111111011101
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
Bytes32a 5f dd
Gray code1111110111000000110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010100101111111011101
64-bit0000000000000000000000000000000000000000001010100101111111011101
One's complement11111111110101011010000000100010at 32 bits, every bit flipped
Bits reversed10111011111110100101010000000000at 32 bits
Rotated left by 100000000010101001011111110111010at 32 bits, wrapping
Shifted left by 110101001011111110111010= 5,554,106, no wrap
Shifted right by 1101010010111111101110= 1,388,526, discarding the low bit
These bits as a double1.37204648 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,777,053 to the power 27,712,023,364,809
2,777,053 to the power 321,416,697,621,312,927,877
2,777,053 to the power 459,475,304,379,359,930,299,606,481
2,777,053 to the power 5165,166,072,452,614,632,518,313,076,880,493
First ten multiples2,777,053, 5,554,106, 8,331,159, 11,108,212, 13,885,265, 16,662,318, 19,439,371, 22,216,424, 24,993,477, 27,770,530
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 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 53
Collatz (3n + 1) trajectory
Steps to reach 1138the total stopping time
Highest value reached8,331,1603× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,777,053 → 8,331,160 → 4,165,580 → 2,082,790 → 1,041,395 → 3,124,186 → 1,562,093 → 4,686,280 → 2,343,140 → 1,171,570 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage277,705,300%
2,777,053% as a decimal27,770.53
2,777,053% of 1002,777,053
2,777,053% of 1,00027,770,530
As a fraction of 1002,777,053/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,777,053
Nerdulate something else
Nothing in mind? Surprise me · today’s page