Recognised as Number
267,248,675,523
- Positive
- Odd
- Composite
- 12 digits
267,248,675,523 is an odd 12-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value267,248,675,523
Digit count12
Digit sum57
Digit product33,868,800
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 89 × 1,000,931,369
Distinct prime factors33, 89, 1,000,931,369
Number of divisors8
Sum of divisors σ(n)360,335,293,200
Aliquot sum93,086,617,677sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)176,163,920,768integers below n that share no factor with it
Carmichael function λ(n)11,010,245,048the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 176,163,920,768
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 89, 267, 1,000,931,369, 3,002,794,107, 89,082,891,841, 267,248,675,5238 in total
Arithmetic
Previous number267,248,675,522
Next number267,248,675,524
Double534,497,351,046
Square71,421,854,568,797,739,323,529
Cube19,087,396,036,907,522,116,689,739,240,280,667
Square root516,961.000001934≈irrational, shown to 9 decimal places
Cube root6,441.275189554≈
Negation-267,248,675,523
Reciprocal3.74183332 × 10^-12≈
Representations
Decimal267,248,675,523
Binary1111100011100101000011001010101100001138 bits
Octal3707120625303
Hexadecimal3E39432AC3
Base 363ERSYLS3
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-three
Ordinaltwo hundred and sixty-seven billion, two hundred and forty-eight million, six hundred and seventy-five thousand, five hundred and twenty-third
Scientific notation2.67248676 × 10^11
Engineering notation267.248676 × 10^9
In other bases
Ternary221112211000112100201110base 3; the most digit-efficient integer base after e: 24 digits
Quinary13334311130104043base 5; one hand: 17 digits
Septenary25210446155334base 7: 14 digits
Nonary845730470643base 9; each digit is two ternary digits: 12 digits
Duodecimal4396505a403base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimala8ff448g3base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal5:43:41:2:23:12:3base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary100TTT0T11001TTT101T01110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001001001001010001110111111111000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000011111000111001010000110010101011000011
Bit length38 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits19within that length
Bit parityodd19 set bits, so odd; 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 c3
Gray code10000100100101111000101011111110100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000011111000111001010000110010101011000011
One's complement1111111111111111111111111100000111000110101111001101010100111100at 64 bits, every bit flipped
Bits reversed1100001101010100110000101001110001111100000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000000111110001110010100001100101010110000110at 64 bits, wrapping
Shifted left by 1111110001110010100001100101010110000110= 534,497,351,046, no wrap
Shifted right by 11111100011100101000011001010101100001= 133,624,337,761, 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,523 to the power 271,421,854,568,797,739,323,529
267,248,675,523 to the power 319,087,396,036,907,522,116,689,739,240,280,667
267,248,675,523 to the power 4510108131004649451052116226508… (46 digits)
267,248,675,523 to the power 5136325722384505537148587080380… (58 digits)
First ten multiples267,248,675,523, 534,497,351,046, 801,746,026,569, 1,068,994,702,092, 1,336,243,377,615, 1,603,492,053,138, 1,870,740,728,661, 2,137,989,404,184, 2,405,238,079,707, 2,672,486,755,230
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 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 3
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 1444the total stopping time
Highest value reached1,202,619,039,8564× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps267,248,675,523 → 801,746,026,570 → 400,873,013,285 → 1,202,619,039,856 → 601,309,519,928 → 300,654,759,964 → 150,327,379,982 → 75,163,689,991 → 225,491,069,974 → 112,745,534,987 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage26,724,867,552,300%
267,248,675,523% as a decimal2,672,486,755.23
267,248,675,523% of 100267,248,675,523
267,248,675,523% of 1,0002,672,486,755,230
As a fraction of 100267,248,675,523/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,523
Nearby primes
Also reads as
267248675523 (identifier)
- 12 characters
- Checksum fails
267248675523 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