Recognised as Number
8,752,273
- Positive
- Odd
- Prime
- 7 digits
8,752,273 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value8,752,273
Digit count7
Digit sum34
Digit product23,520
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation8,752,273
Distinct prime factors18,752,273
Number of divisors2
Sum of divisors σ(n)8,752,274
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,752,272integers below n that share no factor with it
Carmichael function λ(n)8,752,272the 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, 8,752,2732 in total
Arithmetic
Previous number8,752,272
Next number8,752,274
Double17,504,546
Half4,376,136.5
Square76,602,282,666,529
Cube670,444,090,320,629,770,417
Square root2,958.424073726≈irrational, shown to 9 decimal places
Cube root206.082106648≈
Negation-8,752,273
Reciprocal1.14256034 × 10^-7≈
Representations
Decimal8,752,273
Binary10000101100011001001000124 bits
Octal41306221
Hexadecimal858C91
Base 3657LAP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, seven hundred and fifty-two thousand, two hundred and seventy-three
Ordinaleight million, seven hundred and fifty-two thousand, two hundred and seventy-third
Scientific notation8.752273 × 10^6
Engineering notation8.752273 × 10^6
In other bases
Ternary121110122212021base 3; the most digit-efficient integer base after e: 15 digits
Quinary4220033043base 5; one hand: 10 digits
Septenary134251555base 7: 9 digits
Nonary17418767base 9; each digit is two ternary digits: 8 digits
Duodecimal2b20b81base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2ee0ddbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal40:31:11:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1111T000TT1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100110101001110110010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100001011000110010010001
Bit length24 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits15within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes385 8c 91
Gray code110001110100101011011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100001011000110010010001
64-bit0000000000000000000000000000000000000000100001011000110010010001
One's complement11111111011110100111001101101110at 32 bits, every bit flipped
Bits reversed10001001001100011010000100000000at 32 bits
Rotated left by 100000001000010110001100100100010at 32 bits, wrapping
Shifted left by 11000010110001100100100010= 17,504,546, no wrap
Shifted right by 110000101100011001001000= 4,376,136, discarding the low bit
These bits as a double4.32419741 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,752,273 to the power 276,602,282,666,529
8,752,273 to the power 3670,444,090,320,629,770,417
8,752,273 to the power 45,867,909,709,722,809,282,616,907,841
8,752,273 to the power 551,357,547,718,844,781,168,397,331,840,272,593
First ten multiples8,752,273, 17,504,546, 26,256,819, 35,009,092, 43,761,365, 52,513,638, 61,265,911, 70,018,184, 78,770,457, 87,522,730
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
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 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1212the total stopping time
Highest value reached29,941,9723× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,752,273 → 26,256,820 → 13,128,410 → 6,564,205 → 19,692,616 → 9,846,308 → 4,923,154 → 2,461,577 → 7,384,732 → 3,692,366 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage875,227,300%
8,752,273% as a decimal87,522.73
8,752,273% of 1008,752,273
8,752,273% of 1,00087,522,730
As a fraction of 1008,752,273/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 8,752,273
Nerdulate something else
Nothing in mind? Surprise me · today’s page