Recognised as Number
267,248,675,521
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
267,248,675,521 is an odd 12-digit integer and a composite number. It has 5 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value267,248,675,521
Digit count12
Digit sum55
Digit product11,289,600
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 516,961²
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation719^4
Distinct prime factors1719
Number of divisors5
Sum of divisors σ(n)267,620,888,161
Aliquot sum372,212,640sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)266,876,980,562integers below n that share no factor with it
Carmichael function λ(n)266,876,980,562the 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, 719, 516,961, 371,694,959, 267,248,675,5215 in total
Arithmetic
Previous number267,248,675,520
Next number267,248,675,522
Double534,497,351,042
Square71,421,854,567,728,744,621,441
Cube19,087,396,036,478,990,989,280,159,788,445,761
Square root516,961exact
Cube root6,441.275189538≈
Negation-267,248,675,521
Reciprocal3.74183332 × 10^-12≈
Representations
Decimal267,248,675,521
Binary1111100011100101000011001010101100000138 bits
Octal3707120625301
Hexadecimal3E39432AC1
Base 363ERSYLS1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo hundred and sixty-seven billion, two hundred and forty-eight million, six hundred and seventy-five thousand, five hundred and twenty-one
Ordinaltwo hundred and sixty-seven billion, two hundred and forty-eight million, six hundred and seventy-five thousand, five hundred and twenty-first
Scientific notation2.67248676 × 10^11
Engineering notation267.248676 × 10^9
In other bases
Ternary221112211000112100201101base 3; the most digit-efficient integer base after e: 24 digits
Quinary13334311130104041base 5; one hand: 17 digits
Septenary25210446155332base 7: 14 digits
Nonary845730470641base 9; each digit is two ternary digits: 12 digits
Duodecimal4396505a401base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimala8ff448g1base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal5:43:41:2:23:12:1base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary100TTT0T11001TTT101T01101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001001001001010001110111111111000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000011111000111001010000110010101011000001
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 39 43 2a c1
Gray code10000100100101111000101011111110100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000011111000111001010000110010101011000001
One's complement1111111111111111111111111100000111000110101111001101010100111110at 64 bits, every bit flipped
Bits reversed1000001101010100110000101001110001111100000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000000111110001110010100001100101010110000010at 64 bits, wrapping
Shifted left by 1111110001110010100001100101010110000010= 534,497,351,042, no wrap
Shifted right by 11111100011100101000011001010101100000= 133,624,337,760, discarding the low bit
These bits as a double1.32038389 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
267,248,675,521 to the power 271,421,854,567,728,744,621,441
267,248,675,521 to the power 319,087,396,036,478,990,989,280,159,788,445,761
267,248,675,521 to the power 4510108130989379534222761621266… (46 digits)
267,248,675,521 to the power 5136325722379404455838616935454… (58 digits)
First ten multiples267,248,675,521, 534,497,351,042, 801,746,026,563, 1,068,994,702,084, 1,336,243,377,605, 1,603,492,053,126, 1,870,740,728,647, 2,137,989,404,168, 2,405,238,079,689, 2,672,486,755,210
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1276the total stopping time
Highest value reached801,746,026,5643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps267,248,675,521 → 801,746,026,564 → 400,873,013,282 → 200,436,506,641 → 601,309,519,924 → 300,654,759,962 → 150,327,379,981 → 450,982,139,944 → 225,491,069,972 → 112,745,534,986 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage26,724,867,552,100%
267,248,675,521% as a decimal2,672,486,755.21
267,248,675,521% of 100267,248,675,521
267,248,675,521% of 1,0002,672,486,755,210
As a fraction of 100267,248,675,521/100
Read another way
As seconds8,468 years, 218 days and 23 hours
As bytes248.895 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,248,675,521
Nearby primes
Also reads as
267248675521 (identifier)
- 12 characters
- Checksum fails
267248675521 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). No check digit validates. 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 does not matchGS1 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