Recognised as Number
1,052,256
- Positive
- Even
- Composite
- 7 digits
1,052,256 is an even 7-digit integer and a composite number. It has 48 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,052,256
Digit count7
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2^5 × 3 × 97 × 113
Distinct prime factors42, 3, 97, 113
Number of divisors48
Sum of divisors σ(n)2,815,344
Aliquot sum1,763,088sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)344,064integers below n that share no factor with it
Carmichael function λ(n)672the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 344,064
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 96, 97, 113, 194, 226, 291, 339, 388, 452, 582, 678, 776, 904, 1,164, 1,356, 1,552, 1,808, 2,328, 2,712, 3,104, 3,616, 4,656, 5,424, 9,312, 10,848, 10,961, 21,922, 32,883, 43,844, 65,766, 87,688, 131,532, 175,376, 263,064, 350,752, 526,128, 1,052,25648 in total
Arithmetic
Previous number1,052,255
Next number1,052,257
Double2,104,512
Half526,128
Square1,107,242,689,536
Cube1,165,102,763,520,393,216
Square root1,025.795301218≈irrational, shown to 9 decimal places
Cube root101.712376949≈
Negation-1,052,256
Reciprocal9.50339081 × 10^-7≈
Representations
Decimal1,052,256
Binary10000000011100110000021 bits
Octal4007140
Hexadecimal100E60
Base 36MJXC
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, fifty-two thousand, two hundred and fifty-six
Ordinalone million, fifty-two thousand, two hundred and fifty-sixth
Scientific notation1.052256 × 10^6
Engineering notation1.052256 × 10^6
In other bases
Ternary1222110102110base 3; the most digit-efficient integer base after e: 13 digits
Quinary232133011base 5; one hand: 9 digits
Septenary11641542base 7: 8 digits
Nonary1873373base 9; each digit is two ternary digits: 7 digits
Duodecimal428b40base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6bacgbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:52:17:36base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T11011T110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000001001110100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000000111001100000
Bit length21 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits15within that length
Bit parityeven6 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 55 trailing zeros
Power of twoNo
Bytes310 0e 60
Gray code110000000100101010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000000111001100000
64-bit0000000000000000000000000000000000000000000100000000111001100000
One's complement11111111111011111111000110011111at 32 bits, every bit flipped
Bits reversed00000110011100000000100000000000at 32 bits
Rotated left by 100000000001000000001110011000000at 32 bits, wrapping
Shifted left by 11000000001110011000000= 2,104,512, no wrap
Shifted right by 110000000011100110000= 526,128, discarding the low bit
These bits as a double5.1988354 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,052,256 to the power 21,107,242,689,536
1,052,256 to the power 31,165,102,763,520,393,216
1,052,256 to the power 41,225,986,373,530,914,883,895,296
1,052,256 to the power 51,290,051,517,466,146,372,068,128,587,776
First ten multiples1,052,256, 2,104,512, 3,156,768, 4,209,024, 5,261,280, 6,313,536, 7,365,792, 8,418,048, 9,470,304, 10,522,560
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 3
Divisible by 10No, remainder 6
Divisible by 11No, remainder 7
Divisible by 12Yes
Divisible by 100No, remainder 56
Collatz (3n + 1) trajectory
Steps to reach 1196the total stopping time
Highest value reached1,052,256
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,052,256 → 526,128 → 263,064 → 131,532 → 65,766 → 32,883 → 98,650 → 49,325 → 147,976 → 73,988 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage105,225,600%
1,052,256% as a decimal10,522.56
1,052,256% of 1001,052,256
1,052,256% of 1,00010,522,560
As a fraction of 1001,052,256/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 1,052,256
Nerdulate something else
Nothing in mind? Surprise me · today’s page