Recognised as Number
267,261,082,729
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
267,261,082,729 is an odd 12-digit integer and a composite number. It has 3 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value267,261,082,729
Digit count12
Digit sum52
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 516,973²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation516,973^2
Distinct prime factors1516,973
Number of divisors3
Sum of divisors σ(n)267,261,599,703
Aliquot sum516,974sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)267,260,565,756integers below n that share no factor with it
Carmichael function λ(n)267,260,565,756the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 516,973, 267,261,082,7293 in total
Arithmetic
Previous number267,261,082,728
Next number267,261,082,730
Double534,522,165,458
Square71,428,486,341,477,382,087,441
Cube19,090,054,597,316,833,158,153,911,812,906,489
Square root516,973exact
Cube root6,441.374868242≈
Negation-267,261,082,729
Reciprocal3.74165962 × 10^-12≈
Representations
Decimal267,261,082,729
Binary1111100011101000000000011111000110100138 bits
Octal3707200076151
Hexadecimal3E3A007C69
Base 363ES0CJ8P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo hundred and sixty-seven billion, two hundred and sixty-one million, eighty-two thousand, seven hundred and twenty-nine
Ordinaltwo hundred and sixty-seven billion, two hundred and sixty-one million, eighty-two thousand, seven hundred and twenty-ninth
Scientific notation2.67261083 × 10^11
Engineering notation267.261083 × 10^9
In other bases
Ternary221112211212212201012121base 3; the most digit-efficient integer base after e: 24 digits
Quinary13334322314121404base 5; one hand: 17 digits
Septenary25210656502054base 7: 14 digits
Nonary845755781177base 9; each digit is two ternary digits: 12 digits
Duodecimal43969242521base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimala8fj1f6g9base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal5:43:41:59:49:38:49base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary100TTT00TT0T00T0T011T0TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001001001110000000011000110110111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000011111000111010000000000111110001101001
Bit length38 bitsto write the magnitude
Set bits18the population count, or Hamming weight
Zero bits20within that length
Bit parityeven18 set bits, so even; not the same as the number itself being odd
Highest set bitbit 37worth 137,438,953,472
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes53e 3a 00 7c 69
Gray code10000100100111000000000100001001011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000011111000111010000000000111110001101001
One's complement1111111111111111111111111100000111000101111111111000001110010110at 64 bits, every bit flipped
Bits reversed1001011000111110000000000101110001111100000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000000111110001110100000000001111100011010010at 64 bits, wrapping
Shifted left by 1111110001110100000000001111100011010010= 534,522,165,458, no wrap
Shifted right by 11111100011101000000000011111000110100= 133,630,541,364, discarding the low bit
These bits as a double1.32044519 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
267,261,082,729 to the power 271,428,486,341,477,382,087,441
267,261,082,729 to the power 319,090,054,597,316,833,158,153,911,812,906,489
267,261,082,729 to the power 4510202866103462092810566296594… (46 digits)
267,261,082,729 to the power 5136357370406250292259960235119… (58 digits)
First ten multiples267,261,082,729, 534,522,165,458, 801,783,248,187, 1,069,044,330,916, 1,336,305,413,645, 1,603,566,496,374, 1,870,827,579,103, 2,138,088,661,832, 2,405,349,744,561, 2,672,610,827,290
Powers of twoBetween 2^37 (137,438,953,472) and 2^38 (274,877,906,944)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1214the total stopping time
Highest value reached2,029,513,846,9847× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps267,261,082,729 → 801,783,248,188 → 400,891,624,094 → 200,445,812,047 → 601,337,436,142 → 300,668,718,071 → 902,006,154,214 → 451,003,077,107 → 1,353,009,231,322 → 676,504,615,661 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage26,726,108,272,900%
267,261,082,729% as a decimal2,672,610,827.29
267,261,082,729% of 100267,261,082,729
267,261,082,729% of 1,0002,672,610,827,290
As a fraction of 100267,261,082,729/100
Read another way
As seconds8,468 years, 362 days and 13 hours
As bytes248.906 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 267,261,082,729
Nearby primes
Also reads as
267261082729 (identifier)
- 12 characters
- Checksum valid
267261082729 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). The check digit is valid for GTIN-12 (UPC-A). A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-12 (UPC-A)Check digit validGS1 mod 10, weights 3 and 1 alternating from the right
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page