Recognised as Number
1,052,231
- Positive
- Odd
- Prime
- 7 digits
1,052,231 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,052,231
Digit count7
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,052,231
Distinct prime factors11,052,231
Number of divisors2
Sum of divisors σ(n)1,052,232
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,052,230integers below n that share no factor with it
Carmichael function λ(n)1,052,230the 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, 1,052,2312 in total
Arithmetic
Previous number1,052,230
Next number1,052,232
Double2,104,462
Half526,115.5
Square1,107,190,077,361
Cube1,165,019,722,291,642,391
Square root1,025.783115478≈irrational, shown to 9 decimal places
Cube root101.711571432≈
Negation-1,052,231
Reciprocal9.5036166 × 10^-7≈
Representations
Decimal1,052,231
Binary10000000011100100011121 bits
Octal4007107
Hexadecimal100E47
Base 36MJWN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, fifty-two thousand, two hundred and thirty-one
Ordinalone million, fifty-two thousand, two hundred and thirty-first
Scientific notation1.052231 × 10^6
Engineering notation1.052231 × 10^6
In other bases
Ternary1222110101112base 3; the most digit-efficient integer base after e: 13 digits
Quinary232132411base 5; one hand: 9 digits
Septenary11641505base 7: 8 digits
Nonary1873345base 9; each digit is two ternary digits: 7 digits
Duodecimal428b1bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6babbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:52:17:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T11011TTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000001001001011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000000111001000111
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes310 0e 47
Gray code110000000100101100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000000111001000111
64-bit0000000000000000000000000000000000000000000100000000111001000111
One's complement11111111111011111111000110111000at 32 bits, every bit flipped
Bits reversed11100010011100000000100000000000at 32 bits
Rotated left by 100000000001000000001110010001110at 32 bits, wrapping
Shifted left by 11000000001110010001110= 2,104,462, no wrap
Shifted right by 110000000011100100011= 526,115, discarding the low bit
These bits as a double5.19871189 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,052,231 to the power 21,107,190,077,361
1,052,231 to the power 31,165,019,722,291,642,391
1,052,231 to the power 41,225,869,867,406,657,164,724,321
1,052,231 to the power 51,289,898,276,451,174,275,095,037,010,151
First ten multiples1,052,231, 2,104,462, 3,156,693, 4,208,924, 5,261,155, 6,313,386, 7,365,617, 8,417,848, 9,470,079, 10,522,310
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1196the total stopping time
Highest value reached7,102,5646× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,052,231 → 3,156,694 → 1,578,347 → 4,735,042 → 2,367,521 → 7,102,564 → 3,551,282 → 1,775,641 → 5,326,924 → 2,663,462 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage105,223,100%
1,052,231% as a decimal10,522.31
1,052,231% of 1001,052,231
1,052,231% of 1,00010,522,310
As a fraction of 1001,052,231/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,231
Nerdulate something else
Nothing in mind? Surprise me · today’s page