Recognised as Number
2,767,229
- Positive
- Odd
- Prime
- 7 digits
2,767,229 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 value2,767,229
Digit count7
Digit sum35
Digit product21,168
Multiplicative persistence5times 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 factorisation2,767,229
Distinct prime factors12,767,229
Number of divisors2
Sum of divisors σ(n)2,767,230
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,767,228integers below n that share no factor with it
Carmichael function λ(n)2,767,228the 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, 2,767,2292 in total
Arithmetic
Previous number2,767,228
Next number2,767,230
Double5,534,458
Half1,383,614.5
Square7,657,556,338,441
Cube21,190,211,968,867,749,989
Square root1,663.499023144≈irrational, shown to 9 decimal places
Cube root140.393941481≈
Negation-2,767,229
Reciprocal3.61372333 × 10^-7≈
Representations
Decimal2,767,229
Binary101010001110010111110122 bits
Octal12434575
Hexadecimal2A397D
Base 361NB7H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven hundred and sixty-seven thousand, two hundred and twenty-nine
Ordinaltwo million, seven hundred and sixty-seven thousand, two hundred and twenty-ninth
Scientific notation2.767229 × 10^6
Engineering notation2.767229 × 10^6
In other bases
Ternary12012120220222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1202022404base 5; one hand: 10 digits
Septenary32343503base 7: 8 digits
Nonary5176828base 9; each digit is two ternary digits: 7 digits
Duodecimalb154a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalh5i19base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:48:40:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1T0TT10T100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111100100111010001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010100011100101111101
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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 39 7d
Gray code1111110010010111000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010100011100101111101
64-bit0000000000000000000000000000000000000000001010100011100101111101
One's complement11111111110101011100011010000010at 32 bits, every bit flipped
Bits reversed10111110100111000101010000000000at 32 bits
Rotated left by 100000000010101000111001011111010at 32 bits, wrapping
Shifted left by 110101000111001011111010= 5,534,458, no wrap
Shifted right by 1101010001110010111110= 1,383,614, discarding the low bit
These bits as a double1.36719278 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,767,229 to the power 27,657,556,338,441
2,767,229 to the power 321,190,211,968,867,749,989
2,767,229 to the power 458,638,169,076,397,934,934,310,481
2,767,229 to the power 5162,265,241,975,111,581,090,337,058,027,149
First ten multiples2,767,229, 5,534,458, 8,301,687, 11,068,916, 13,836,145, 16,603,374, 19,370,603, 22,137,832, 24,905,061, 27,672,290
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 181the total stopping time
Highest value reached10,506,8323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,767,229 → 8,301,688 → 4,150,844 → 2,075,422 → 1,037,711 → 3,113,134 → 1,556,567 → 4,669,702 → 2,334,851 → 7,004,554 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage276,722,900%
2,767,229% as a decimal27,672.29
2,767,229% of 1002,767,229
2,767,229% of 1,00027,672,290
As a fraction of 1002,767,229/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,767,229
Nerdulate something else
Nothing in mind? Surprise me · today’s page